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 条

[1] Mathematical models for multicontainer loading problems [J].

Alonso, M. T. ;

Alvarez-Valdes, R. ;

Iori, M. ;

Parreno, F. ;

Tamarit, J. M. .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2017, 66 :106-117

[2]

[Anonymous], 2002, VEHICLE ROUTING PROB

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

[4] Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem [J].

Chen, Ping ;

Huang, Hou-kuan ;

Dong, Xing-Ye .

EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (02) :1620-1627

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

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

[7] A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS [J].

CROES, GA .

OPERATIONS RESEARCH, 1958, 6 (06) :791-812

[8]

Doerner KF, 2007, NETWORKS, V49, P294, DOI [10.1002/net.20179, 10.1002/net]

[9] NEW OPTIMIZATION HEURISTICS - THE GREAT DELUGE ALGORITHM AND THE RECORD-TO-RECORD TRAVEL [J].

DUECK, G .

JOURNAL OF COMPUTATIONAL PHYSICS, 1993, 104 (01) :86-92

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

← 1 2 3 →