Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints

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.

[1]  Maria Grazia Speranza,et al.  A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks , 2013, Networks.

[2]  Gregorio Tirado,et al.  The double traveling salesman problem with multiple stacks: A variable neighborhood search approach , 2009, Comput. Oper. Res..

[3]  Michel Gendreau,et al.  A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks , 2012, Networks.

[4]  G. Laporte,et al.  A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading , 2010 .

[5]  Gregorio Tirado,et al.  Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints , 2011, Eur. J. Oper. Res..

[6]  Mauro Dell'Amico,et al.  A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks , 2013, INFORMS J. Comput..

[7]  Matthias Ehrgott,et al.  An exact method for the double TSP with multiple stacks , 2010, Int. Trans. Oper. Res..

[8]  Daniele Vigo,et al.  An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints , 2007, Transp. Sci..

[9]  Jesper Larsen,et al.  Improved exact method for the double TSP with multiple stacks , 2011, Networks.

[10]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[11]  Manuel Iori,et al.  Routing problems with loading constraints , 2010 .

[12]  Maria Grazia Speranza,et al.  Exact solutions to the double travelling salesman problem with multiple stacks , 2010, Networks.

[13]  Manuel Iori,et al.  Heuristic and exact algorithms for the multi-pile vehicle routing problem , 2011, OR Spectr..

[14]  Andrew Lim,et al.  The single container loading problem with axle weight constraints , 2013 .

[15]  Bernard Jacob,et al.  Improving truck safety: Potential of weigh-in-motion technology , 2010 .

[16]  Michel Gendreau,et al.  Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks , 2012, Networks.

[17]  Richard F. Hartl,et al.  Metaheuristics for the vehicle routing problem with loading constraints , 2007 .

[18]  Kjetil Fagerholt,et al.  Routing and scheduling of RoRo ships with stowage constraints , 2011 .

[19]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[20]  Oli B. G. Madsen,et al.  The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches , 2009, Eur. J. Oper. Res..