Multiple ACO-based method for solving dynamic MSMD traffic routing problem in connected vehicles

Abstract

In this study, we focus on dynamic traffic routing of connected vehicles with various origins and destinations; this is referred to as a multi-source multi-destination traffic routing problem. Ant colony optimization (ACO)-based routing method, together with the idea of coloring ants, is proposed to solve the defined problem in a distributed manner. Using the concept of coloring ants, traffic flows of connected vehicles to different destinations can be distinguished. To evaluate the performance of the proposed method, we perform simulations on the multi-agent NetLogo platform. The simulation results indicate that the ACO-based routing method outperforms the shortest path-based routing method (i.e., given the same simulation period, the average travel time decreases by 8% on average and by 11% in the best case, whereas the total number of arrived vehicles increases by 13% on average and by 23% in the best case).