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 条
[11]   A grouping genetic algorithm for the pickup and delivery problem with time windows [J].
Pankratz, G .
OR SPECTRUM, 2005, 27 (01) :21-41
[12]   An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows [J].
Ropke, Stefan ;
Pisinger, David .
TRANSPORTATION SCIENCE, 2006, 40 (04) :455-472
[13]   Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows [J].
Ropke, Stefan ;
Cordeau, Jean-Francois .
TRANSPORTATION SCIENCE, 2009, 43 (03) :267-286
[14]   The pickup and delivery problem: Faces and branch-and-cut algorithm [J].
Ruland, KS ;
Rodin, EY .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1997, 33 (12) :1-13
[15]   An efficient heuristic for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads [J].
Sahin, Mustafa ;
Cavuslar, Gizem ;
Oncan, Temel ;
Sahin, Guvenc ;
Tuzun Aksu, Dilek .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2013, 27 :169-188
[16]   Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces [J].
Storn, R ;
Price, K .
JOURNAL OF GLOBAL OPTIMIZATION, 1997, 11 (04) :341-359
[17]   Differential evolution algorithm with local search for capacitated vehicle routing problem [J].
Teoh, Boon Ean ;
Ponnambalam, S. G. ;
Kanagaraj, G. .
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2015, 7 (05) :321-342
[18]   A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems [J].
Wang, Ling ;
Pan, Quan-Ke ;
Suganthan, P. N. ;
Wang, Wen-Hong ;
Wang, Ya-Min .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (03) :509-520
[19]   A multi-objective memetic algorithm based on locality-sensitive hashing for one-to-many-to-one dynamic pickup-and-delivery problem [J].
Zhu, Zexuan ;
Xiao, Jun ;
He, Shan ;
Ji, Zhen ;
Sun, Yiwen .
INFORMATION SCIENCES, 2016, 329 :73-89