We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Traffic Control Problems using Graph Connectivity

by Arun Kumar Baruah
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 86 - Number 11
Year of Publication: 2014
Authors: Arun Kumar Baruah
10.5120/15026-3342

Arun Kumar Baruah . Traffic Control Problems using Graph Connectivity. International Journal of Computer Applications. 86, 11 ( January 2014), 1-3. DOI=10.5120/15026-3342

@article{ 10.5120/15026-3342,
author = { Arun Kumar Baruah },
title = { Traffic Control Problems using Graph Connectivity },
journal = { International Journal of Computer Applications },
issue_date = { January 2014 },
volume = { 86 },
number = { 11 },
month = { January },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume86/number11/15026-3342/ },
doi = { 10.5120/15026-3342 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:03:54.738462+05:30
%A Arun Kumar Baruah
%T Traffic Control Problems using Graph Connectivity
%J International Journal of Computer Applications
%@ 0975-8887
%V 86
%N 11
%P 1-3
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In modern day automobile traffic the problem of traffic congestion calls for the design of efficient control strategies. In this paper it is argued that in order to have efficient and systematic solutions to a traffic control problem at an intersection, graph theoretic models of the problem are quite appropriate for its exploitation. Connectivity of compatibility graph of a traffic intersection can be used to study the most efficient route or the traffic control system to direct the traffic flow to its maximum capacity using the minimum number of edges or the minimum number of vertices. This result has got application in traffic control problems at an arbitrary intersection so as to minimize the waiting time of the traffic participants and the cost of locating the sensors in order to collect traffic data.

References
  1. Gazis, D. C. , 1970, Traffic Science, John Wiley & Sons, New York.
  2. Gazis, D. C. , 2002, Traffic Theory, Kluwer Academic Publishers, London.
  3. Gu, W. , Jia, X. , 2005, On a Traffic Control Problem, 8th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN' 05).
  4. Gu, W. , Jia, X. , 2006, On a Traffic Sensing Problem, Preprint, Texas State University, 2006.
  5. Riedel, T. , 2002, Traffic Control using Graph Theory, Verkehrs- Systeme AG.
  6. Stoffers, E. K. , 1968, Scheduling of Traffic Lights – A New Approach, Transportation Research, 2, 199.
  7. Monahan, Torin, 2007, " War Rooms" of the street: Suveillance Practices in Transportation Control Centers. The Communication Review 10(4), 367-389.
  8. World Road Association, 2002, Road Network Operation Handbook.
  9. Tarnoff, P. , John, B. , Darcy, M. , Young, S. E. et. al. , 2009, Continuing Evolution of Travel Data Information Collection and Processing, Transportation Research Board Annual Meeting.
  10. Guberinic, S. , Senborn, G. , Lazic, B. . 2008, Optimal Traffic Control Urban Intersection, CRC Press.
  11. Deo, N. , 2000, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall Inc. , New Jersey.
  12. West, D. B. , 2001, Introduction to Graph Theory, Prentice Hall Inc. , New Jersey.
  13. Wilson, R. J. , Watkins, J. J. , 1989, Graph : An Introductory Approach, John Wiley & Sons, New York.
  14. Baruah, N. , Baruah, A. K. , 2012, On a Traffic Control Problem using Cut-Set of Graph, International Journal of Advanced Networking and Applications, 3(4), 1240-1244. .
Index Terms

Computer Science
Information Sciences

Keywords

Compatibility Graph Edge Connectivity Intelligent Transportation System Traffic Control Traffic Sensors Vertex Connectivity.