Research Article

Optimal Feasible Green Light Assignment to a Traffic Intersection using Intersection Graph

by  A. Bharali, A. K. Baruah
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 65 - Issue 12
Published: March 2013
Authors: A. Bharali, A. K. Baruah
10.5120/10973-6121
PDF

A. Bharali, A. K. Baruah . Optimal Feasible Green Light Assignment to a Traffic Intersection using Intersection Graph. International Journal of Computer Applications. 65, 12 (March 2013), 1-4. DOI=10.5120/10973-6121

                        @article{ 10.5120/10973-6121,
                        author  = { A. Bharali,A. K. Baruah },
                        title   = { Optimal Feasible Green Light Assignment to a Traffic Intersection using Intersection Graph },
                        journal = { International Journal of Computer Applications },
                        year    = { 2013 },
                        volume  = { 65 },
                        number  = { 12 },
                        pages   = { 1-4 },
                        doi     = { 10.5120/10973-6121 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2013
                        %A A. Bharali
                        %A A. K. Baruah
                        %T Optimal Feasible Green Light Assignment to a Traffic Intersection using Intersection Graph%T 
                        %J International Journal of Computer Applications
                        %V 65
                        %N 12
                        %P 1-4
                        %R 10.5120/10973-6121
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

A feasible green light assignment is an assignment of time period to each traffic stream so that only compatible traffic streams are allowed to recieve overlapping time period. In case of an intersection, it is almost always possible to find several feasible green light assignments. We usually have some goal such as to minimise the total waiting time, to maximise the volume of flow etc. , to be achieved. In this paper we will try to find an optimal feasible green light assignment which minimises the waiting time at the same time maximises the volume of flow, using intersection graph.

References
  • S. Benzer, On the topology of the genetic fine structure, Proc. Nat. Acad. Sci. USA, 45, pp. 1607-1620, 1959.
  • D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math. , 15, pp. 835-855, 1965.
  • P. C. Gilmore, A. J. Hoffman, A characterization of comparability graphs and of interval graphs, Canad. J. Math. , 16, pp. 539-548, 1964.
  • S. Guberinic, G. Senborn, B. Lazic, Optimal Traffic Control: Urban Intersections, CRC Press 2008.
  • F. Harary, Topics in Graph Theory, New York Academy of Sciences, 1979.
  • C. B. Lekkerkerker, J. C. Boland, Representation of a finite graph by a set of intervals on the real line, Fund. Math. , 51, pp. 45-64.
  • Fred S. Roberts Graph Theory and Its Applications to Problems of Society, SIAM, Philadelphia, 1978.
  • K. E. Stoffers, Scheduling of traffic lights-A new approach, Transportation Research, 2, pp. 199-234, 1968.
  • D. B. West, Introduction to Graph Theory, Prentice Hall, 1996.
  • F. R. McMorris, Terry A. McKee, Topics in Intersection Graph Theory, SIAM, 1987.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Compatibility Graph Intersection Graph Traffic Network

Powered by PhDFocusTM