基于大邻域的两级路由问题启发式算法
A large neighbourhood based heuristic for two-echelon routing problems
摘要:
在本文中,我们解决两个优化问题的背景下,城市物流和两级运输系统。两级车辆路径问题和两级位置路径问题寻求产生车辆行程以将货物运送到客户,并通过中间设施中转。为了有效地解决这些问题,我们提出了一种混合元启发式算法,它结合了枚举本地搜索与破坏和修复原则,以及一些量身定制的运营商,以优化中间设施的选择。我们进行了广泛的计算实验,调查这些运营商的搜索性能的贡献,并衡量这两个问题类的方法的性能。该算法发现目前最好的已知的解决方案,或更好的,为95%的两级车辆路径问题的基准实例。总的来说,对于这两个问题,它在很短的计算时间内实现了高质量的解决方案。最后,为了将来的参考,我们解决了不同版本的基准测试实例之间的不一致性,记录它们的差异,并以统一的格式在线提供它们。
英文摘要:
In this paper, we address two optimisation problems arising in the context of city logistics and two-level transportation systems. The two-echelon vehicle routing problem and the two-echelon location routing problem seek to produce vehicle itineraries to deliver goods to customers, with transits through intermediate facilities. To efficiently solve these problems, we propose a hybrid metaheuristic which combines enumerative local searches with destroy-and-repair principles, as well as some tailored operators to optimise the selections of intermediate facilities. We conduct extensive computational experiments to investigate the contribution of these operators to the search performance, and measure the performance of the method on both problem classes. The proposed algorithm finds the current best known solutions, or better ones, for 95% of the two-echelon vehicle routing problem benchmark instances. Overall, for both problems, it achieves high-quality solutions within short computing times. Finally, for future reference, we resolve inconsistencies between different versions of benchmark instances, document their differences, and provide them all online in a unified format.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。