Abstract
AbstractLarge-scale dynamic vehicle routing problem (LSDVRP) is exhibiting extensive application prospect with the rapid growth of online logistics, whereas a few approaches have been developed to address LSDVRPs. The difficulty in solving LSDVRPs lies in that it requires quick response and high adaptability to numerous newly appeared customers in LSDVRPs. To overcome this difficulty, in this paper, we propose a responsive ant colony optimization algorithm, termed as RACO, for efficiently addressing LSDVRPs. In the proposed RACO, a pheromone diversity enhancing method is suggested to generate diverse pheromone matrices for quickly responding to newly appeared customer requests in solving LSDVRPs. A pheromone ensemble technique is further designed to produce a high-quality initial population that well adapts to the new customer requests by making use of diverse pheromone matrices. Empirical results on a set of 12 LSDVRP test instances demonstrate the effectiveness of the suggested pheromone diversity enhancing method in quickly responding to newly appeared customer requests for solving LSDVRPs. Moreover, we investigate the computational cost and the traveling cost obtained by the proposed RACO to evaluate responsiveness and adaptability of the proposed RACO, respectively. Comparison with four state-of-the-art approaches to DVRPs validates the superiority of the proposed RACO in addressing LSDVRPs in terms of responsiveness and adaptability.
Funder
National Natural Science Foundation of China
recruitment program for Leading Talent Team of Anhui Province
State Key Laboratory of Synthetical Automation for Process Industries
Anhui Provincial Natural Science Foundation
Key Program of Natural Science Project of Educational Commission of Anhui Province
Publisher
Springer Science and Business Media LLC
Subject
General Earth and Planetary Sciences,General Environmental Science
Reference48 articles.
1. AbdAllah AMF, Essam DL, Sarker RA (2017) On solving periodic re-optimization dynamic vehicle routing problems. Applied Soft Computing 55:1–12
2. Abdirad M, Krishnan K, Gupta D (2021) A two-stage metaheuristic algorithm for the dynamic vehicle routing problem in industry 4.0 approach. J Manag Anal 8(1):69–83
3. Archetti C, Guerriero F, Macrina G (2021) The online vehicle routing problem with occasional drivers. Comput Oper Res 127:105144
4. Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30(5):787–800
5. Cao Z, Jiang S, Zhang J, Guo H (2016) A unified framework for vehicle rerouting and traffic light control to reduce traffic congestion. IEEE Trans Intell Transp Syst 18(7):1958–1973
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献