.png){kind=icon}
.png){kind=icon}
Return
Constraint programming-based solution approaches for three-dimensional loading capacitated vehicle routing problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2022.108505.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Constraint programming
Vehicle routing problem
Time windows
Container loading problem
Decomposition
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W