Skip to main content
Erschienen in: EURO Journal on Transportation and Logistics 2/2016

01.06.2016 | Research Paper

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

verfasst von: Hanne Pollaris, Kris Braekers, An Caris, Gerrit K. Janssens, Sabine Limbourg

Erschienen in: EURO Journal on Transportation and Logistics | Ausgabe 2/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat 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–55 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–55
Zurück zum Zitat 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–75CrossRef 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–75CrossRef
Zurück zum Zitat 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–59CrossRef 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–59CrossRef
Zurück zum Zitat 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–30CrossRef 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–30CrossRef
Zurück zum Zitat 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–226CrossRef 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–226CrossRef
Zurück zum Zitat Doerner K, Fuellerer G, Hartl R, Gronalt M, Iori M (2007) Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4):294–307CrossRef Doerner K, Fuellerer G, Hartl R, Gronalt M, Iori M (2007) Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4):294–307CrossRef
Zurück zum Zitat 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–2993CrossRef 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–2993CrossRef
Zurück zum Zitat 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–75CrossRef 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–75CrossRef
Zurück zum Zitat Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18(1):4–27CrossRef Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18(1):4–27CrossRef
Zurück zum Zitat 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–264CrossRef 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–264CrossRef
Zurück zum Zitat Jacob B, Feypell-de La Beaumelle V (2010) Improving truck safety: potential of weigh-in-motion technology. IATSS Res 34(1):9–15CrossRef Jacob B, Feypell-de La Beaumelle V (2010) Improving truck safety: potential of weigh-in-motion technology. IATSS Res 34(1):9–15CrossRef
Zurück zum Zitat Lim A, Ma H, Qiu C, Zhu W (2013) The single container loading problem with axle weight constraints. Int J Prod Econ 144:358–369CrossRef Lim A, Ma H, Qiu C, Zhu W (2013) The single container loading problem with axle weight constraints. Int J Prod Econ 144:358–369CrossRef
Zurück zum Zitat Lusby R, Larsen J (2011) Improved exact method for the double TSP with multiple stacks. Networks 58(4):290–300CrossRef Lusby R, Larsen J (2011) Improved exact method for the double TSP with multiple stacks. Networks 58(4):290–300CrossRef
Zurück zum Zitat 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–652CrossRef 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–652CrossRef
Zurück zum Zitat Ø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–1242CrossRef Ø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–1242CrossRef
Zurück zum Zitat 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–147CrossRef 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–147CrossRef
Zurück zum Zitat Petersen H, Archetti C, Speranza M (2010) Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4):229–243CrossRef Petersen H, Archetti C, Speranza M (2010) Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4):229–243CrossRef
Zurück zum Zitat Toth P, Vigo D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia Toth P, Vigo D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia
Zurück zum Zitat 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–959CrossRef 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–959CrossRef
Metadaten
Titel
Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints
verfasst von
Hanne Pollaris
Kris Braekers
An Caris
Gerrit K. Janssens
Sabine Limbourg
Publikationsdatum
01.06.2016
Verlag
Springer Berlin Heidelberg
Erschienen in
EURO Journal on Transportation and Logistics / Ausgabe 2/2016
Print ISSN: 2192-4376
Elektronische ISSN: 2192-4384
DOI
https://doi.org/10.1007/s13676-014-0064-2

Weitere Artikel der Ausgabe 2/2016

EURO Journal on Transportation and Logistics 2/2016 Zur Ausgabe