Memory-Based Ant Colony System Approach for Multi-Source Data Associated Dynamic Electric Vehicle Dispatch Optimization

• Published in: IEEE transactions on intelligent transportation systems Vol. 23; no. 10; pp. 17491 - 17505
• Main Authors: Shi, Lin, Zhan, Zhi-Hui, Liang, Di, Zhang, Jun
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-10-2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Ant colony optimization; Batteries; Car sharing; Charging stations; Customer services; Customers; Dynamic electric vehicle dispatch (DEVD); Dynamic tests; Electric vehicle charging; Electric vehicles; Fuels; Heuristic algorithms; intelligent transportation; memory-based ant colony optimization (MACO); multi-source data association; Optimization; Public transportation; Vehicle dynamics
• ISSN: 1524-9050; 1558-0016
• DOI: 10.1109/TITS.2022.3150471

The developments of electric vehicle (EV) technology and mobile internet technology have made the EV-oriented ride-hailing service a trend in smart cities. In the service scenario, a high-quality order allocation approach is in great need to quickly process a series of customer request orders, so as to reduce total customer waiting time and transportation cost. To simulate real-world customer-EV allocation scenarios, in this paper, a dynamic EV dispatch (DEVD) model is established by considering multi-source data association from five sources, including customer, vehicle, charging, station, and service. To solve the proposed multi-source data associated DEVD model, a memory-based ant colony optimization (MACO) approach is developed. MACO maintains a memory archive to store the historically good solutions, which not only can be used to update pheromone to guide the search, but also can be used to help the reactions to environmental changes. In response to dynamic changes, a partial reassignment strategy is also proposed to re-optimize some of the assigned customer-EV pairs in the historically best solution. Moreover, an exchange or replace local search procedure is designed to enhance the performance. The MACO algorithm is applied to a set of dynamic test cases with different customer request and EV sizes. Experimental results show that MACO generally outperforms the first-come-first-served approach and some state-of-the-art ACO-based dynamic optimization algorithms.