Iterated Local Search for the Capacitated Vehicle Routing Problem with Sequence-Based Pallet Loading and Axle Weight Constraints

被引：17

作者：

Pollaris, Hanne ^{[1
]}

Braekers, Kris ^{[1
,2
]}

Caris, An ^{[1
]}

Janssens, Gerrit K. ^{[1
]}

Limbourg, Sabine ^{[3
]}

机构：

[1] UHasselt, Res Grp Logist, Agoralaan, B-3590 Diepenbeek, Belgium

[2] Res Fdn Flanders FWO, Egmontstr 5, BE-1000 Brussels, Belgium

[3] Univ Liege ULg, QuantOM, HEC Management Sch, Rue Louvrex 14 N1, B-4000 Liege, Belgium

来源：

NETWORKS | 2017年 / 69卷 / 03期

基金：

比利时弗兰德研究基金会;

关键词：

Vehicle Routing Problem; axle weight constraints; routing & loading; iterated local search; sequence-based loading; Capacitated Vehicle Routing Problem; TRAVELING SALESMAN PROBLEM; LARGE NEIGHBORHOOD SEARCH; MULTIPLE STACKS; DOUBLE TSP; ALGORITHM; PICKUP;

D O I：

10.1002/net.21738

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this article an Iterated Local Search algorithm for the capacitated vehicle routing problem with sequencebased pallet loading and axle weight constraints is presented. Axle weight limits impose a great challenge for transportation companies. Yet, the literature on the incorporation of axle weight constraints in vehicle routing models is very scarce. The effect of introducing axle weight constraints in a CVRP on total routing cost is analyzed. Results show that integrating axle weight constraints does not lead to a large cost increase. However, not including axle weight constraints in the planning process may induce major axle weight violations. (C) 2017 Wiley Periodicals, Inc.

引用

页码：304 / 316

页数：13

共 28 条

[21] 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

[22] 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

[23] Vehicle routing problems with loading constraints: state-of-the-art and future directions [J].

Pollaris, Hanne ;

Braekers, Kris ;

Caris, An ;

Janssens, Gerrit K. ;

Limbourg, Sabine .

OR SPECTRUM, 2015, 37 (02) :297-330

[24] Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints [J].

Pollaris, Hanne ;

Braekers, Kris ;

Caris, An ;

Janssens, Gerrit K. ;

Limbourg, Sabine .

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2016, 5 (02) :231-255

[25] An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows [J].

Ropke, Stefan ;

Pisinger, David .

TRANSPORTATION SCIENCE, 2006, 40 (04) :455-472

[26] A tabu search heuristic for the vehicle routing problem with soft time windows [J].

Taillard, E ;

Badeau, P ;

Gendreau, M ;

Guertin, F ;

Potvin, JY .

TRANSPORTATION SCIENCE, 1997, 31 (02) :170-186

[27] 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

[28]

WATERS CDJ, 1987, J OPER RES SOC, V38, P833, DOI 10.1057/jors.1987.137

← 1 2 3 →