In this paper, we introduce and study the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. To the best of our knowledge, it is the first time that axle weight restrictions are incorporated in a vehicle routing model. The aim of this paper is to demonstrate that incorporating axle weight restrictions in a vehicle routing model is possible and necessary for a feasible route planning. Axle weight limits impose a great challenge for transportation companies. Trucks with overloaded axles represent a significant threat for traffic safety and may cause serious damage to the road surface. Transporters face high fines when violating these limits. A mixed integer linear programming formulation for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is provided. Results of the model are compared to the results of the model without axle weight restrictions. Computational experiments demonstrate that the model performs adequately and that the integration of axle weight constraints in vehicle routing models is required for a feasible route planning.
This is a preview of subscription content, log in to check access.
This work is supported by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office (COMEX project: Combinatorial Optimization: Metaheuristics and Exact methods).
Alba M, Cordeau J, Dell'Amico M, Iori M (2013) A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. INFORMS J Comput 25(1):41–55Google Scholar
Carrabs F, Cerulli R, Speranza M (2013) A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61(1):58–75CrossRefGoogle Scholar
Cordeau J, Iori M, Laporte G, Salazar González J (2010) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1):46–59CrossRefGoogle Scholar
Côté J, Gendreau M, Potvin J (2012a) Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(1):19–30CrossRefGoogle Scholar
Côté J, Archetti C, Speranza M, Gendreau M, Potvin J (2012b) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4):212–226CrossRefGoogle Scholar
Doerner K, Fuellerer G, Hartl R, Gronalt M, Iori M (2007) Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4):294–307CrossRefGoogle Scholar
Felipe A, Ortuño MT, Tirado G (2009) The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Comput Oper Res 36(11):2983–2993CrossRefGoogle Scholar
Felipe A, Ortuño M, Tirado G (2011) Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints. Eur J Oper Res 211(1):66–75CrossRefGoogle Scholar