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.

  • Availability:
  • Authors:
    • Yang, Zhongzhen
    • Yu, Bin
    • Cheng, Chuntian
  • Publication Date: 2007-1


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01042289
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Feb 24 2007 11:53PM