Hybrid evolutionary optimization for takeaway order selection and delivery path planning utilizing habit data

被引:12
作者
Zhang, Min-Xia [1 ]
Wu, Jia-Yu [1 ]
Wu, Xue [1 ]
Zheng, Yu-Jun [2 ]
机构
[1] Zhejiang Univ Technol, Coll Comp Sci & Technol, Hangzhou, Peoples R China
[2] Hangzhou Normal Univ, Sch Informat Sci & Engn, Hangzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
Takeaway delivery; Order selection; Path planning; Evolutionary optimization; Water wave optimization (WWO); Machine learning; VEHICLE-ROUTING PROBLEM; GENETIC ALGORITHM; TIME; CONSOLIDATION;
D O I
10.1007/s40747-021-00410-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The last years have seen a rapid growth of the takeaway delivery market, which has provided a lot of jobs for deliverymen. However, increasing numbers of takeaway orders and the corresponding pickup and service points have made order selection and path planning a key challenging problem to deliverymen. In this paper, we present a problem integrating order selection and delivery path planning for deliverymen, the objective of which is to maximize the revenue per unit time subject to maximum delivery path length, overdue penalty, reward/penalty for large/small number of orders, and high customer scoring reward. Particularly, we consider uncertain order ready time and customer satisfaction level, which are estimated based on historical habit data of stores and customers using a machine-learning approach. To efficiently solve this problem, we propose a hybrid evolutionary algorithm, which adapts the water wave optimization (WWO) metaheuristic to evolve solutions to the main order selection problem and employs tabu search to route the delivery path for each order selection solution. Experimental results on test instances constructed based on real food delivery application data demonstrate the performance advantages of the proposed algorithm compared to a set of popular metaheuristic optimization algorithms.
引用
收藏
页码:4425 / 4440
页数:16
相关论文
共 57 条
[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]   Novel binary differential evolution algorithm for knapsack problems [J].
Ali, Ismail M. ;
Essam, Daryl ;
Kasmarik, Kathryn .
INFORMATION SCIENCES, 2021, 542 :177-194
[3]   A genetic algorithm for the vehicle routing problem [J].
Baker, BM ;
Ayechew, MA .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) :787-800
[4]   A Modified Binary Particle Swarm Optimization for Knapsack Problems [J].
Bansal, Jagdish Chand ;
Deep, Kusum .
APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (22) :11042-11061
[5]   Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery [J].
Bianchessi, Nicola ;
Righini, Giovanni .
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (02) :578-594
[6]   Evaluation of the size of time windows for the travelling salesman problem in delivery operations [J].
Budak, Gercek ;
Chen, Xin .
COMPLEX & INTELLIGENT SYSTEMS, 2020, 6 (03) :681-695
[7]  
Chen HW, 2018, PROCEEDINGS OF 2018 TENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), P546, DOI 10.1109/ICACI.2018.8377518
[8]   Data-driven optimization for last-mile delivery [J].
Chu, Hongrui ;
Zhang, Wensi ;
Bai, Pengfei ;
Chen, Yahong .
COMPLEX & INTELLIGENT SYSTEMS, 2023, 9 (03) :2271-2284
[9]   A genetic algorithm for the multidimensional knapsack problem [J].
Chu, PC ;
Beasley, JE .
JOURNAL OF HEURISTICS, 1998, 4 (01) :63-86
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197