Analytics and machine learning in vehicle routing research

被引:62
作者
Bai, Ruibin [1 ]
Chen, Xinan [1 ]
Chen, Zhi-Long [2 ]
Cui, Tianxiang [1 ]
Gong, Shuhui [3 ]
He, Wentao [1 ]
Jiang, Xiaoping [4 ]
Jin, Huan [1 ]
Jin, Jiahuan [1 ]
Kendall, Graham [5 ,6 ]
Li, Jiawei [1 ]
Lu, Zheng [1 ]
Ren, Jianfeng [1 ]
Weng, Paul [7 ,8 ]
Xue, Ning [8 ]
Zhang, Huayan [1 ]
机构
[1] Univ Nottingham Ningbo China, Sch Comp Sci, Ningbo, Peoples R China
[2] Univ Maryland, Robert H Smith Sch Business, College Pk, MD 20742 USA
[3] China Univ Geosci, Comp Sci, Beijing, Peoples R China
[4] Natl Univ Def Technol, Operat Res, Hefei, Peoples R China
[5] Univ Nottingham, Sch Comp Sci, Nottingham, England
[6] Shanghai Jiao Tong Univ, UM SJTU Joint Inst, Shanghai, Peoples R China
[7] Shanghai Jiao Tong Univ, Dept Automat, Shanghai, Peoples R China
[8] Univ Nottingham, Fac Med & Hlth Sci, Nottingham, England
基金
中国国家自然科学基金;
关键词
Vehicle routing; machine learning; data driven methods; uncertainties; LARGE NEIGHBORHOOD SEARCH; BRANCH-AND-PRICE; STOCHASTIC TRAVEL-TIMES; COMBINATORIAL OPTIMIZATION; COLONY ALGORITHM; DELIVERY PROBLEM; WINDOWS; SERVICE; DESIGN; PICKUP;
D O I
10.1080/00207543.2021.2013566
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The Vehicle Routing Problem (VRP) is one of the most intensively studied combinatorial optimisation problems for which numerous models and algorithms have been proposed. To tackle the complexities, uncertainties and dynamics involved in real-world VRP applications, Machine Learning (ML) methods have been used in combination with analytical approaches to enhance problem formulations and algorithmic performance across different problem solving scenarios. However, the relevant papers are scattered in several traditional research fields with very different, sometimes confusing, terminologies. This paper presents a first, comprehensive review of hybrid methods that combine analytical techniques with ML tools in addressing VRP problems. Specifically, we review the emerging research streams on ML-assisted VRP modelling and ML-assisted VRP optimisation. We conclude that ML can be beneficial in enhancing VRP modelling, and improving the performance of algorithms for both online and offline VRP optimisations. Finally, challenges and future opportunities of VRP research are discussed.
引用
收藏
页码:4 / 30
页数:27
相关论文
共 210 条
[1]   Solving urban transit route design problem using selection hyper-heuristics [J].
Ahmed, Leena ;
Mumford, Christine ;
Kheiri, Ahmed .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (02) :545-559
[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]   The dynamic multiperiod vehicle routing problem with probabilistic information [J].
Albareda-Sambola, Maria ;
Fernandez, Elena ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2014, 48 :31-39
[4]   A Machine Learning-Based Approximation of Strong Branching [J].
Alvarez, Alejandro Marcos ;
Louveaux, Quentin ;
Wehenkel, Louis .
INFORMS JOURNAL ON COMPUTING, 2017, 29 (01) :185-195
[5]  
Anuar WadiKhalid. M., 2019, P INT C SEC MAN SAM2
[6]   A survey on matheuristics for routing problems [J].
Archetti, Claudia ;
Speranza, M. Grazia .
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2014, 2 (04) :223-246
[7]   A green delivery-pickup problem for home hemodialysis machines; sharing economy in distributing scarce resources [J].
Asghari, Mohammad ;
Al-e-hashem, S. Mohammad J. Mirzapour .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2020, 134
[8]  
Asta S, 2014, 2014 IEEE SYMPOSIUM ON EVOLVING AND AUTONOMOUS LEARNING SYSTEMS (EALS), P65, DOI 10.1109/EALS.2014.7009505
[9]  
Augerat P., 1995, Computational results with a branch and cut code for the capacitated vehicle routing problem, V34, P949
[10]   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