A Deterministic Annealing Algorithm for a Bi-Objective Full Truckload Vehicle Routing Problem in Drayage Operations

被引:20
作者
Braekers, Kris [1 ]
Caris, An [1 ]
Janssens, Gerrit K. [1 ]
机构
[1] Hasselt Univ, Transportat Res Inst, B-3590 Diepenbeek, Belgium
来源
STATE OF THE ART IN THE EUROPEAN QUANTITATIVE ORIENTED TRANSPORTATION AND LOGISTICS RESEARCH, 2011: 14TH EURO WORKING GROUP ON TRANSPORTATION & 26TH MINI EURO CONFERENCE & 1ST EUROPEAN SCIENTIFIC CONFERENCE ON AIR TRANSPORT | 2011年 / 20卷
关键词
Drayage operations; vehicle routing; deterministic annealing; bi-objective; traveling salesman problem; SEARCH;
D O I
10.1016/j.sbspro.2011.08.040
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Drayage operations involve transporting loaded and empty containers in the hinterland of a port. In this paper a full truckload vehicle routing problem in drayage operations is studied. Either the origin or destination of empty container transport requests is unknown in advance. A two-phase solution algorithm using deterministic annealing is presented to solve the bi-objective problem, minimizing the number of vehicles used and minimizing total distance travelled. Results on random problem instances show that the algorithm is able to find sets of non-dominated solutions of good quality in a small amount of computation time. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of the Organizing Committee.
引用
收藏
页数:10
相关论文
共 22 条
[1]   A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows [J].
Bent, R ;
Van Hentenryck, P .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (04) :875-893
[2]  
Braekers K, 2010, 8TH INTERNATIONAL INDUSTRIAL SIMULATION CONFERENCE 2010, ISC 2010, P172
[3]  
Braysy O., 2003, CENTRAL EUR J OPER R, V11, P369
[4]   An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows [J].
Braysy, Olli ;
Dullaert, Wout ;
Hasle, Geir ;
Mester, David ;
Gendreau, Michel .
TRANSPORTATION SCIENCE, 2008, 42 (03) :371-386
[5]  
Caris An, 2010, International Journal of Computer Aided Engineering and Technology, V2, P340, DOI 10.1504/IJCAET.2010.035390
[6]   Heuristic solutions to the problem of routing school buses with multiple objectives [J].
Corberán, A ;
Fernández, E ;
Laguna, M ;
Martí, R .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (04) :427-435
[7]   THRESHOLD ACCEPTING - A GENERAL-PURPOSE OPTIMIZATION ALGORITHM APPEARING SUPERIOR TO SIMULATED ANNEALING [J].
DUECK, G ;
SCHEUER, T .
JOURNAL OF COMPUTATIONAL PHYSICS, 1990, 90 (01) :161-175
[8]   A survey and annotated bibliography of multiobjective combinatorial optimization [J].
Ehrgott M. ;
Gandibleux X. .
OR-Spektrum, 2000, 22 (4) :425-460
[9]  
Ehrgott M., 2002, Multiobjective Combinatorial OptimizationTheory, Methodology, and Applications, P369, DOI [10.1007/b101915, DOI 10.1007/B101915]
[10]   Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm [J].
Ghoseiri, Keivan ;
Ghannadpour, Seyed Farid .
APPLIED SOFT COMPUTING, 2010, 10 (04) :1096-1107