CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

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

by A. Bharali, A. K. Baruah
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 65 - Number 12
Year of Publication: 2013
Authors: A. Bharali, A. K. Baruah
10.5120/10973-6121

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 },
issue_date = { March 2013 },
volume = { 65 },
number = { 12 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume65/number12/10973-6121/ },
doi = { 10.5120/10973-6121 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:21:02.027782+05:30
%A A. Bharali
%A A. K. Baruah
%T Optimal Feasible Green Light Assignment to a Traffic Intersection using Intersection Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 65
%N 12
%P 1-4
%D 2013
%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
  1. S. Benzer, On the topology of the genetic fine structure, Proc. Nat. Acad. Sci. USA, 45, pp. 1607-1620, 1959.
  2. D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math. , 15, pp. 835-855, 1965.
  3. P. C. Gilmore, A. J. Hoffman, A characterization of comparability graphs and of interval graphs, Canad. J. Math. , 16, pp. 539-548, 1964.
  4. S. Guberinic, G. Senborn, B. Lazic, Optimal Traffic Control: Urban Intersections, CRC Press 2008.
  5. F. Harary, Topics in Graph Theory, New York Academy of Sciences, 1979.
  6. 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.
  7. Fred S. Roberts Graph Theory and Its Applications to Problems of Society, SIAM, Philadelphia, 1978.
  8. K. E. Stoffers, Scheduling of traffic lights-A new approach, Transportation Research, 2, pp. 199-234, 1968.
  9. D. B. West, Introduction to Graph Theory, Prentice Hall, 1996.
  10. F. R. McMorris, Terry A. McKee, Topics in Intersection Graph Theory, SIAM, 1987.
Index Terms

Computer Science
Information Sciences

Keywords

Compatibility Graph Intersection Graph Traffic Network

Powered by PhDFocusTM