A Hybrid Differential Evolution Algorithm for the Online Meal Delivery Problem

被引:0
作者
Chen, Jing-fang [1 ]
Wang, Shengyao [2 ]
Wang, Ling [1 ]
Zheng, Jie [1 ]
Cha, Ying [2 ]
Hao, Jinghua [2 ]
He, Renqing [2 ]
Sun, Zhizhao [2 ]
机构
[1] Tsinghua Univ, Dept Automat, Beijing, Peoples R China
[2] Meituan Dianping Grp, Beijing, Peoples R China
来源
2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2020年
基金
中国国家自然科学基金;
关键词
online meal delivery problem; pickup and delivery problem; differential evolution; regret heuristic; PICKUP; SEARCH; BRANCH; CUT;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, the online food ordering (OFO) platforms have arose fast and brought huge convenience to people in daily life. Under the scenario of a realistic OFO platform, this paper addresses an online meal delivery problem (OMDP). To reduce the search space, the OMDP is decomposed into two sub-problems, i.e., the pickup and delivery problem and the order dispatching problem. To solve each sub-problem effectively, a hybrid differential evolution algorithm is proposed, which is fused by the DE-based phase to plan routes and the heuristic-based phase to determine order dispatching schemes. In the DE-based routing phase, a heuristic considering the urgency of orders is designed to generate the initial population with certain quality. Besides, a mutation operator is developed to enhance the exploration and a crossover operator embedded with local search is designed to enhance the exploitation. In the heuristic-based dispatching phase, a regret heuristic is presented to produce good dispatching solutions by introducing the influences between delivery persons. Numerical tests have been carried out and computational results demonstrate the effectiveness of the proposed algorithm.
引用
收藏
页数:8
相关论文
共 19 条
[1]   A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J].
Ai, The Jin ;
Kachitvichyanukul, Voratas .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1693-1702
[2]  
[Anonymous], 2014, AICS
[3]   Static pickup and delivery problems: a classification scheme and survey [J].
Berbeglia, Gerardo ;
Cordeau, Jean-Francois ;
Gribkovskaia, Irina ;
Laporte, Gilbert .
TOP, 2007, 15 (01) :1-31
[4]   A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery [J].
Catay, Buelent .
EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (10) :6809-6817
[5]   A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry [J].
Dechampai, Darat ;
Tanwanichkul, Ladda ;
Sethanan, Kanchana ;
Pitakaso, Rapeepan .
JOURNAL OF INTELLIGENT MANUFACTURING, 2017, 28 (06) :1357-1376
[6]   THE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS [J].
DUMAS, Y ;
DESROSIERS, J ;
SOUMIS, F .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 54 (01) :7-22
[7]   Robust Dynamic Multi-Objective Vehicle Routing Optimization Method [J].
Guo, Yi-Nan ;
Cheng, Jian ;
Luo, Sha ;
Gong, Dunwei ;
Xue, Yu .
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2018, 15 (06) :1891-1903
[8]   An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows [J].
Lai Mingyong ;
Cao Erbao .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2010, 23 (02) :188-195
[9]   A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows [J].
Lu, Quan ;
Dessouky, Maged M. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (02) :672-687
[10]  
M.-D. Group, 2019, ANN RES 3 MONTHS END