An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem

被引：64
作者：
Dayarian, Iman [1 ]
Crainic, Teodor Gabriel [2 ,4 ]
Gendreau, Michel [3 ,4 ]
Rei, Walter [2 ,4 ]
机构：
[1] Georgia Inst Technol, Sch Ind & Syst Engn, Atlanta, GA 30332 USA
[2] Univ Quebec, Sch Management, Montreal, PQ, Canada
[3] Ecole Polytech, MAGI, Montreal, PQ, Canada
[4] CIRRELT, CP 8888,Succ Ctr Ville, Montreal, PQ H3C 3P8, Canada
来源：
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2016年 / 95卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
Multi-period vehicle routing problem with seasonal fluctuations; Tactical planning; Seasonal variation; Adaptive large neighborhood search; CAPACITY EXPANSION; OPTIMIZATION; COLLECTION; ALGORITHM; FRAMEWORK; SOLVE;
D O I：
10.1016/j.tre.2016.09.004
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
This problem involves optimizing product collection and redistribution from production locations to a set of processing plants over a planning horizon. This horizon consists of several days, and the collection-redistribution is performed on a repeating daily basis. A single routing plan must be prepared for the whole horizon, taking into account the seasonal variations in the supply. We model the problem using a sequence of periods, each corresponding to a season. We propose an adaptive large-neighborhood search with several specifically designed operators and features. The results show the excellent performance of the algorithm in terms of solution quality and computational efficiency. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码：95 / 123
页数：29
相关论文
共 55 条
[1]   Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem [J].
Adulyasak, Yossiri ;
Cordeau, Jean-Francois ;
Jans, Raf .
TRANSPORTATION SCIENCE, 2014, 48 (01) :20-45
[2]   An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem [J].
Aksen, Deniz ;
Kaya, Onur ;
Salman, F. Sibel ;
Tuncel, Ozge .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 239 (02) :413-426
[3]  
Angelelli E., 2002, QUANTITATIVE APPROAC, P269, DOI [10.1007/978-3-642-56183-2_16, DOI 10.1007/978-3-642-56183-2_16, DOI 10.1016/J.ENDM.2004.03.011]
[4]   Competitive analysis for dynamic multiperiod uncapacitated routing problems [J].
Angelelli, Enrico ;
Speranza, M. Grazia ;
Savelsbergh, Martin W. P. .
NETWORKS, 2007, 49 (04) :308-317
[5]  
Athanasopoulos T., 2011, THESIS
[6]   Optimization of algorithms with OPAL [J].
Audet C. ;
Dang K.-C. ;
Orban D. .
Mathematical Programming Computation, 2014, 6 (03) :233-254
[7]   An adaptive large neighborhood search for a vehicle routing problem with multiple routes [J].
Azi, Nabila ;
Gendreau, Michel ;
Potvin, Jean-Yves .
COMPUTERS & OPERATIONS RESEARCH, 2014, 41 :167-173
[8]  
Beullens P, 2004, REVERSE LOGISTICS: QUANTITATIVE MODELS FOR CLOSED-LOOP SUPPLY CHAINS, P95
[9]   Collection of recyclables from cubes - A case study [J].
Bogh, Morten Bie ;
Mikkelsen, Hardy ;
Wohlk, Sanne .
SOCIO-ECONOMIC PLANNING SCIENCES, 2014, 48 (02) :127-134
[10]  
Chiang W.-C., 1999, ANN OPER RES, V63, P421
123456