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

来源：

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS | 2016年 / 5卷 / 02期

关键词：

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 条

[11] The single container loading problem with axle weight constraints [J].

Lim, Andrew ;

Ma, Hong ;

Qiu, Chaoyang ;

Zhu, Wenbin .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 144 (01) :358-369

[12] Improved Exact Method for the Double TSP with Multiple Stacks [J].

Lusby, Richard M. ;

Larsen, Jesper .

NETWORKS, 2011, 58 (04) :290-300

[13] An exact method for the double TSP with multiple stacks [J].

Lusby, Richard M. ;

Larsen, Jesper ;

Ehrgott, Matthias ;

Ryan, David .

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2010, 17 (05) :637-652

[14] A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks [J].

Martinez, Manuel A. Alba ;

Cordeau, Jean-Francois ;

Dell'Amico, Mauro ;

Iori, Manuel .

INFORMS JOURNAL ON COMPUTING, 2013, 25 (01) :41-55

[15] Routing and scheduling of RoRo ships with stowage constraints [J].

Ovstebo, Bernt Olav ;

Hvattum, Lars Magnus ;

Fagerholt, Kjetil .

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2011, 19 (06) :1225-1242

[16] Exact Solutions to the Double Travelling Salesman Problem with Multiple Stacks [J].

Petersen, Hanne L. ;

Archetti, Claudia ;

Speranza, M. Grazia .

NETWORKS, 2010, 56 (04) :229-243

[17] The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches [J].

Petersen, Hanne L. ;

Madsen, Oli B. G. .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (01) :139-147

[18]

Toth P., 2002, VEHICLE ROUTING PROB

[19] Heuristic and exact algorithms for the multi-pile vehicle routing problem [J].

Tricoire, Fabien ;

Doerner, Karl F. ;

Hartl, Richard F. ;

Iori, Manuel .

OR SPECTRUM, 2011, 33 (04) :931-959

← 1 2 →