A column generation based algorithm for optimally solving a daily log routing problem in the Argentinean forest industry is presented in this work. Minimum-cost truck-routes are dynamically generated by two complementary pricing procedures within this algorithm. The proposed decomposition procedure is able to provide optimal and or near optimal transportation plans for large instances found in the context of the argentine forest industry which considers several modelling features usually no considered in standard OR routing problems. The proposed algorithm is evaluated on several instances from the literature and on a realistic large scale example.

中文翻译：

---

通过列生成优化阿根廷森林工业中的原木运输

在这项工作中，提出了一种基于列生成的算法，用于优化解决阿根廷森林工业中的日常日志路由问题。最小成本的卡车路线由该算法中的两个互补定价程序动态生成。对于在阿根廷森林工业中发现的大型实例，所提出的分解程序能够为大型实例提供最佳或接近最佳的运输计划，该实例考虑了通常在标准OR路由问题中未考虑的几个建模特征。所提出的算法在文献中的几个实例上以及一个实际的大规模示例中进行了评估。