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

被引:30
作者
Pollaris, Hanne [1 ]
Braekers, Kris [1 ,2 ]
Caris, An [1 ,2 ]
Janssens, Gerrit K. [1 ]
Limbourg, Sabine [3 ]
机构
[1] Hasselt Univ, Agoralaan,Gebouw D, B-3590 Diepenbeek, Belgium
[2] Res Fdn Flanders FWO, Egmontstr 5, B-1000 Brussels, Belgium
[3] Univ Liege ULg, HEC Management Sch, QuantOM, Rue Louvrex 14,N1, B-4000 Liege, Belgium
关键词
Vehicle routing problem; Loading constraints; Axle weight restrictions; Pallet loading; Sequence-based loading;
D O I
10.1007/s13676-014-0064-2
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:231 / 255
页数:25
相关论文
共 19 条
[1]   A branch-and-bound algorithm for the double travelling salesman problem with two stacks [J].
Carrabs, Francesco ;
Cerulli, Raffaele ;
Speranza, Maria Grazia .
NETWORKS, 2013, 61 (01) :58-75
[2]   A Branch-and-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading [J].
Cordeau, Jean-Francois ;
Iori, Manuel ;
Laporte, Gilbert ;
Salazar Gonzalez, Juan Jose .
NETWORKS, 2010, 55 (01) :46-59
[3]   A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks [J].
Cote, Jean-Francois ;
Archetti, Claudia ;
Speranza, Maria Grazia ;
Gendreau, Michel ;
Potvin, Jean-Yves .
NETWORKS, 2012, 60 (04) :212-226
[4]   Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks [J].
Cote, Jean-Francois ;
Gendreau, Michel ;
Potvin, Jean-Yves .
NETWORKS, 2012, 60 (01) :19-30
[5]  
Doerner KF, 2007, NETWORKS, V49, P294, DOI [10.1002/net.20179, 10.1002/net]
[6]   Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints [J].
Felipe, Angel ;
Teresa Ortuno, M. ;
Tirado, Gregorio .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (01) :66-75
[7]   The double traveling salesman problem with multiple stacks: A variable neighborhood search approach [J].
Felipe, Angel ;
Teresa Ortuno, M. ;
Tirado, Gregorio .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) :2983-2993
[8]   An exact approach for the vehicle routing problem with two-dimensional loading constraints [J].
Iori, Manuel ;
Salazar-Gonzalez, Juan-Jose ;
Vigo, Daniele .
TRANSPORTATION SCIENCE, 2007, 41 (02) :253-264
[9]  
Iori M, 2010, TOP, V18, P4, DOI 10.1007/s11750-010-0144-x
[10]   Improving truck safety: Potential of weigh-in-motion technology [J].
Jacob, Bernard ;
Feypell-de la Beaumelle, Veronique .
IATSS RESEARCH, 2010, 34 (01) :9-15