当前位置: X-MOL 学术Comput. Ind. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Constraint Programming-Based Solution Approaches for Three-Dimensional Loading Capacitated Vehicle Routing Problems
Computers & Industrial Engineering ( IF 7.9 ) Pub Date : 2022-07-26 , DOI: 10.1016/j.cie.2022.108505
Mustafa Küçük, Seyda Topaloglu Yildiz

This paper presents constraint programming-based solution approaches for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) that consists of vehicle routing and three-dimensional loading problems in distribution logistics. Despite the practical benefits in the logistics world, the 3L-CVRP has not been extensively studied in the literature for its high combinatorial complexity. Therefore, we developed integrated and decomposed constraint programming-based solution methods in this study. The decomposed models outperformed the mixed-integer programming model proposed earlier in the literature for small-size problems. Furthermore, we solved the well-known benchmark problems with a decomposed model using constraint programming for the vehicle routing part of the problem and an evolutionary algorithm for the loading part. The computational study results show that the best-known results are improved in 36 of 93 problems.



中文翻译:

基于约束规划的三维加载电容式车辆路径问题的求解方法

本文提出了基于约束规划的解决方法,用于解决由配送物流中的车辆路径和三维装载问题组成的三维装载容量车辆路径问题(3L-CVRP)。尽管在物流领域具有实际优势,但 3L-CVRP 因其高组合复杂性而未在文献中得到广泛研究。因此,我们在本研究中开发了基于集成和分解约束规划的求解方法。分解后的模型优于文献中早先针对小规模问题提出的混合整数规划模型。此外,我们通过分解模型解决了众所周知的基准问题,该模型对问题的车辆路径部分使用约束规划,对加载部分使用进化算法。

更新日期:2022-07-27
down
wechat
bug