Advertisement

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

  • Hanne PollarisEmail author
  • Kris Braekers
  • An Caris
  • Gerrit K. Janssens
  • Sabine Limbourg
Research Paper

Abstract

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.

Keywords

Vehicle routing problem Loading constraints Axle weight restrictions Pallet loading Sequence-based loading 

Notes

Acknowledgements

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).

References

  1. 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
  2. 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
  3. 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
  4. 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
  5. 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
  6. 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
  7. 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
  8. 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
  9. Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18(1):4–27CrossRefGoogle Scholar
  10. Iori M, Salazar-González J, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp Sci 41(2):253–264CrossRefGoogle Scholar
  11. Jacob B, Feypell-de La Beaumelle V (2010) Improving truck safety: potential of weigh-in-motion technology. IATSS Res 34(1):9–15CrossRefGoogle Scholar
  12. Lim A, Ma H, Qiu C, Zhu W (2013) The single container loading problem with axle weight constraints. Int J Prod Econ 144:358–369CrossRefGoogle Scholar
  13. Lusby R, Larsen J (2011) Improved exact method for the double TSP with multiple stacks. Networks 58(4):290–300CrossRefGoogle Scholar
  14. Lusby R, Larsen J, Ehrgott M, Ryan D (2010) An exact method for the double TSP with multiple stacks. Int Trans Oper Res 17(5):637–652CrossRefGoogle Scholar
  15. Øvstebø B, Hvattum LM, Fagerholt K (2011) Routing and scheduling of roro ships with stowage constraints. Transp Res Part C: Emerg Technol 19(6):1225–1242CrossRefGoogle Scholar
  16. Petersen H, Madsen O (2009) The double travelling salesman problem with multiple stacks formulation and heuristic solution approaches. Eur J Oper Res 198(1):139–147CrossRefGoogle Scholar
  17. Petersen H, Archetti C, Speranza M (2010) Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4):229–243CrossRefGoogle Scholar
  18. Toth P, Vigo D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, PhiladelphiaGoogle Scholar
  19. Tricoire F, Doerner K, Hartl R, Iori M (2011) Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectr 33(4):931–959CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg and EURO - The Association of European Operational Research Societies 2014

Authors and Affiliations

  • Hanne Pollaris
    • 1
    Email author
  • Kris Braekers
    • 1
    • 2
  • An Caris
    • 1
    • 2
  • Gerrit K. Janssens
    • 1
  • Sabine Limbourg
    • 3
  1. 1.Hasselt UniversityDiepenbeekBelgium
  2. 2.Research Foundation Flanders (FWO)BrusselsBelgium
  3. 3.University of Liege (ULg), HEC Management SchoolLiegeBelgium

Personalised recommendations