Vehicle Routing Problem; axle weight constraints; routing & loading; iterated local search; sequence-based loading; Capacitated Vehicle Routing Problem
Abstract :
[en] In this article an Iterated Local Search algorithm for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is presented. Axle weight limits impose a great challenge for transportation companies. Yet, the literature on the incorporation of axle weight constraints in vehicle routing models is very scarce. The effect of introducing axle weight constraints in a CVRP on total routing cost is analyzed. Results show that integrating axle weight constraints does not lead to a large cost increase. However, not including axle weight constraints in the planning process may induce major axle weight violations.
Disciplines :
Quantitative methods in economics & management
Author, co-author :
Pollaris, Hanne; UHasselt > UHasselt, Research group Logistics, Agoralaan, Diepenbeek, Belgium
Braekers, Kris; UHasselt > Research group Logistics, Agoralaan, Diepenbeek, Belgium
Caris, An; UHasselt > Research group Logistics, Agoralaan, Diepenbeek, Belgium
Janssens, Gerrit, K.; UHasselt > Research group Logistics, Agoralaan, Diepenbeek, Belgium
M. Alba, J. Cordeau, M. Dell'Amico, and M. Iori, A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks, INFORMS J Comput 25 (2013), 41–55.
M. Alonso, R. Alvarez-Valdes, M. Iori, F. Parreño, and J. Tamarit, Mathematical models for multicontainer loading problems, Omega 66 (2017), 106–117.
F. Carrabs, R. Cerulli, and M.G. Speranza, A branch-and-bound algorithm for the double travelling salesman problem with two stacks, Networks 61 (2013), 58–75.
P. Chen, H. Huang, and X.-Y. Dong, Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem, Expert Syst Appl 37 (2010), 1620–1627.
J. Côté, C. Archetti, M. Speranza, M. Gendreau, and J. Potvin, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, Networks 60 (2012), 212–226.
J. Côté, M. Gendreau, and J. Potvin, Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks, Networks 60 (2012), 19–30.
G. Croes, A method for solving traveling-salesman problems, Oper Res 6 (1958), 791–812.
K. Doerner, G. Fuellerer, R. Hartl, M. Gronalt, and M. Iori, Metaheuristics for the vehicle routing problem with loading constraints, Networks 49 (2007), 294–307.
G. Dueck, New optimization heuristics: The great deluge algorithm and the record-to-record travel, J Comput Phys 104 (1993), 86–92.
A. Felipe, M. Ortuño, and G. Tirado, Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints, Eur J Oper Res 211 (2011), 66–75.
A. Felipe, M.T. Ortuño, and G. Tirado, The double traveling salesman problem with multiple stacks: A variable neighborhood search approach, Comput Oper Res 36 (2009), 2983–2993.
M. Iori and S. Martello, Routing problems with loading constraints, TOP 18 (2010), 4–27.
B. Jacob and V. Feypell-de La Beaumelle, Improving truck safety: Potential of weigh-in-motion technology, IATSS Res 34 (2010), 9–15.
A. Lim, H. Ma, C. Qiu, and W. Zhu, The single container loading problem with axle weight constraints, Int J Prod Econ 144 (2013), 358–369.
M. López-Ibáñez, J. Dubois-Lacoste, L. Pérez Cáceres, M. Birattari, and T. Stützle, The irace package: Iterated racing for automatic algorithm configuration, Oper Res Perspect 3 (2016), 43–58.
H. Lourenço, O. Martin, and T. Stützle, “Iterated local search: Framework and applications,” Handbook of metaheuristics, Vol. 146 of International Series in Operations Research & Management Science, M. Gendreau and J. Potvin (Editors), Springer, US, 2010, pp. 363–397.
R.M. Lusby and J. Larsen, Improved exact method for the double TSP with multiple stacks, Networks 58 (2011), 290–300.
R.M. Lusby, J. Larsen, M. Ehrgott, and D. Ryan, An exact method for the double TSP with multiple stacks, Int Trans Oper Res 17 (2010), 637–652.
B. Øvstebø, L.M. Hvattum, and K. Fagerholt, Routing and scheduling of roro ships with stowage constraints, Transp Res Part C Emerg Technol 19 (2011), 1225–1242.
H.L. Petersen, C. Archetti, and M.G. Speranza, Exact solutions to the double travelling salesman problem with multiple stacks, Networks 56 (2010), 229–243.
H.L. Petersen and O. Madsen, The double travelling salesman problem with multiple stacks formulation and heuristic solution approaches, Eur J Oper Res 198 (2009), 139–147.
H. Pollaris, K. Braekers, A. Caris, G.K. Janssens, and S. Limbourg, Vehicle routing problems with loading constraints: State-of-the-art and future directions, OR Spectrum 37 (2015), 297–330.
H. Pollaris, K. Braekers, A. Caris, G.K. Janssens, and S. Limbourg, Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints, EURO J Transp Logist 5 (2016), 231–255.
S. Røpke and D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transp Sci 40 (2006), 455–472.
E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J. Potvin, A tabu search heuristic for the vehicle routing problem with soft time windows, Transp Sci 31 (1997), 170–186.
P. Toth and D. Vigo, The vehicle routing problem, Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia, 2002.
F. Tricoire, K. Doerner, R. Hartl, and M. Iori, Heuristic and exact algorithms for the multi-pile vehicle routing problem, OR Spectrum 33 (2011), 931–959.
C. Waters, A solution procedure for the vehicle-scheduling problem based on iterative route improvement, J Oper Res Soc 38 (1987), 833–839.