A Parallel Ant Colony Algorithm for Bus Network Optimization

This paper presents an optimization model for a bus network design based on the coarse-grain parallel ant colony algorithm (CPACA). It aims to maximize the number of direct travelers/unit length; that is, direct traveler density, subject to route length and nonlinear rate constraints (ratio of the length of a route to the shortest road distance between origin and destination). CPACA is a new optimal algorithm that 1) develops a new strategy to update the increased pheromone, called Ant-Weight, by which the path-searching activities of ants are adjusted based on the objective function, and 2) uses parallelization strategies of an ant colony algorithm (ACA) to improve the calculation time and the quality of the optimization. Data collected in Dalian City, China, is used to test the model and the algorithm. Results show that the optimized bus network has significantly reduced transfers and travel time. The data also reveals that the proposed CPACA is effective and efficient compared to some existing ant algorithms.

[1]  Eric Bonabeau,et al.  Evolving Ant Colony Optimization , 1998, Adv. Complex Syst..

[2]  Partha Chakroborty,et al.  Optimal Scheduling of Urban Transit Systems Using Genetic Algorithms , 1995 .

[3]  Ai Kah Soh,et al.  An expert system for the preliminary design of offshore topside superstructures , 1991 .

[4]  Wu Qing.  AN ANT COLONY ALGORITHM WITH MUTATION FEATURES , 1999 .

[5]  Hani S. Mahmassani,et al.  Hybrid route generation heuristic algorithm for the design of transit networks , 1995 .

[6]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[7]  D. Hasselström.  PUBLIC TRANSPORTATION PLANNING: A MATHEMATICAL PROGRAMMING APPROACH , 1981 .

[8]  Peng-Yeng Yin,et al.  Ant colony search algorithms for optimal polygonal approximation of plane curves , 2003, Pattern Recognit..

[9]  D. F. Dubois,et al.  A Set of Methods in Transportation Network Synthesis and Analysis , 1979 .

[10]  Michel Gendreau,et al.  Applications of parallel computing in transportation - introduction , 2001, Parallel Computing.

[11]  Ahmed Fahmy,et al.  A proof of convergence for Ant algorithms , 2004, Inf. Sci..

[12]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[13]  Thomas Stützle,et al.  The MAX–MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Global Optimization , 1997 .

[14]  Gabriele Kotsis,et al.  Parallelization strategies for the ant system , 1998 .

[15]  Partha Chakroborty,et al.  Genetic Algorithms for Optimal Urban Transit Network Design , 2003 .

[16]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[17]  P. Kreuzer,et al.  Optimal lines for railway systems , 1997 .

[18]  Hai Yang,et al.  Determine network transit line configuration for optimal passenger line assignment , 2004, IEEE International Conference on Networking, Sensing and Control, 2004.

[19]  Hartmut Schmeck,et al.  Multi Colony Ant Algorithms , 2002, J. Heuristics.

[20]  Prianka N. Seneviratne.  ANALYSIS OF ON-TIME PERFORMANCE OF BUS SERVICES USING SIMULATION , 1990 .

[21]  R Fernandez.  AN EXPERT SYSTEM FOR THE PRELIMINARY DESIGN AND LOCATION OF HIGH-CAPACITY BUS-STOPS , 1993 .

[22]  Jenny Valentine,et al.  The Ant Colony , 2009 .

[23]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).