A modified ant colony algorithm for multiple sight-seeing buses route replanning in emergency

Abstract

Multiple Sight-seeing bus (multi-sight-seeing-buses) route replanning is one of the most complicated global optimum problems in buses control. Based on the construction of the basic model of multi-sight-seeing-buses route replanning, which includes problem description, crossroad congestion modeling, constraint conditions and algorithm mechanism, a novel modified Ant Colony Optimization(ACO) approach is presented in detail. In view of the characteristics of multi-sight-seeing-buses route replanning in dynamic and uncertain environments, the crossroads congestion in paths are adopted to save time, and a blackboard mechanism is introduced into the system for improving the adaptability. Considering the timing constraint, the route of each bus is decided first. Then the Left Length of Arrival(LLA) and velocity of each bus are determined. Simulation experiments are performed under the complicated traffic environment containing some default parameter values and popup changes. The results demonstrate the feasibility and the effectiveness of the proposed approach. © 2010 Binary Information Press.