A Hybrid BSO-ACO for Dynamic Vehicle Routing Problem on Real-World Road Networks

• Published in: IEEE access Vol. 10; pp. 118302 - 118312
• Main Authors: Liu, Mingde, Song, Qi, Zhao, Qi, Li, Ling, Yang, Zhiming, Zhang, Yingbin
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Ant colony optimization; brain storm optimization; Clustering algorithms; Costs; dynamic vehicle routing problem with time windows; Harnesses; Heuristic algorithms; Logistics; road network; Road traffic; Roads; Route planning; Search problems; Test sets; Transportation networks; Vehicle dynamics; Vehicle routing
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2022.3221191

The Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) is an NP-hard problem, which has attracted a lot of attention in the past decades due to its many practical applications in logistics. In order to better describe the actual logistics distribution scenario, this paper studies the DVRPTW based on real road networks and proposes the hybrid BSO-ACO algorithm, which is a combination of Brain Storm Optimization (BSO), Ant Colony Optimization (ACO) and Neighborhood Search (2-opt, relocate, exchange). The <xref ref-type="algorithm" rid="alg1">algorithm 1 ) uses ACO to generate new individuals from the same cluster formed by BSO, and increases exploitation by ACO's pheromone accumulation, 2) harnesses the 2-opt, relocate, and exchange to increase exploration to avoid the algorithm from falling into local optima. We construct a test set by extracting the real road networks in Panyu District, Guangzhou, China and compare the hybrid BSO-ACO algorithm with other algorithms on this test set. The computation experiments show the effectiveness and efficiency of the hybrid BSO-ACO algorithm.