Using Ant Colony Optimization for Solving Traffic Signal Coordination in Oversaturated Networks

This article proposes to solve the oversaturated network traffic signal coordination problem using the Ant Colony Optimization (ACO) algorithm. The traffic network used is a discrete time model which uses the green times at all the intersections throughout the period of oversaturation as the decision variables. The Ant Colony Optimization algorithm takes the green times as variables and generates an intelligent timing plan which takes care of dissipation of queues and removal of blockages as opposed to just the minimization of cost in the case of undersaturation. The network is then solved for different cases of ACO using different number of ants and trials. The results are then compared with Simple Genetic Algorithms (SGA) for similar cases and statistical analysis is done to determine the better algorithm. Further, a master-slave parallelism is suggested for ACO to reduce the execution time allowing the opportunity to implement the algorithm on real-time signal control systems.


  • English

Media Info

  • Media Type: DVD
  • Features: Figures; References; Tables;
  • Pagination: 18p
  • Monograph Title: TRB 89th Annual Meeting Compendium of Papers DVD

Subject/Index Terms

Filing Info

  • Accession Number: 01154610
  • Record Type: Publication
  • Report/Paper Numbers: 10-2669
  • Files: BTRIS, TRIS, TRB
  • Created Date: Jan 25 2010 11:17AM