11 views

Uploaded by TJPRC Publications

TJPRC JOURNALS

- Graph Theory
- 10.1109@APAP.2011.6180431
- Lowell W. Beineke & Robin J. Wilson & Peter J. Cameron - Topics in Algebraic Graph Theory
- Pr Maths Yr6 2010
- Oblong Mean Prime Labeling of Some Tree Graphs
- A NOTE ON NON SPLIT LOCATING EQUITABLE DOMINATION
- YEd
- Original_Byzantine
- Shortest Path
- Graphs Dec17 2012
- Graphs
- Graphs
- 08. graphIntro
- Role of Adjacency Matrix in Graph Theory
- 9BWG5HDF-10.1.1.9.945
- 370-1-710-1-10-20150123
- Incremental Pagerank
- [Jural] Are Tumor Cell Lineages Solely Shaped by Mechanical Forces
- algoritmiaa
- ada

You are on page 1of 6

ISSN(P): 2249-6955; ISSN(E): 2249-8060

Vol. 6, Issue 3, Jun 2016, 29-34

TJPRC Pvt. Ltd.

MODELLING TRAFFIC CONTROL PROBLEMS

SHAKERA TANVEER

Department of Mathematics Government First Grade College Afzalpur, Kalaburagi, Karnataka, India

ABSTRACT

The main objective of this paper is to present the application of graph theory in modelling the real life

problems by representing them in terms of graphs. Many real- world problems can be conveniently represented in terms

of graphs by means of points (vertices) and lines (edges). This article gives the application of connectivity (vertex or

edge) in traffic management problems in an efficient way by minimizing the waiting time of the traffic participants and

the cost to locate the sensors at an appropriate place so as to have the traffic data and this has been shown by two

examples.

KEYWORDS: Graph Theory, Traffic Control Problem, Connectivity (Vertex or Edge), Mathematical Modelling

INTRODUCTION

Now a days Graph theory is playing a vital role in every branch of Science and Technology. Also it is

widely used in almost other fields like Sociology, Biology, biochemistry (genomics), Chemistry (for the study of

molecules, construction of bonds and for the study of atoms), Electrical engineering (communication networks

Original Article

Received: May 02, 2016; Accepted: May 23, 2016; Published: Jun 21, 2016; Paper Id.: IJMCARJUN201603

and coding theory), Computer Science (algorithms and computation) and operations research (scheduling) etc.

The most important concept of graph coloring is used in scheduling problems (final exams at a university or jobs

in a factory) and resource allocations. Also, paths, walks and circuits in graph theory are used in tremendous

applications say traveling salesman problem, concepts on database design, resource networking which leads to the

development of new algorithms and new theorems that can be used in various applications [1 & 5]. The edge

connectivity as well as vertex connectivity is used as graph theoretic tools to study traffic control problem at an

intersection.

Due to huge population and urbanization of small towns and cities, the increase in the number of vehicles

led to the increase in time losses of traffic participants, the increase of environmental and noise pollution leads to

the increasing number of traffic accidents. The major obstacle for the development of many urban areas is the

traffic congestion which is also affecting millions of people. The construction of new roads may improve the

situation, but it is very costly and in many cases it is impossible due to the existing structures. Instead of

constructing the new roads, the other way to control the traffic flow in such a situation is to use the current road

network in an efficient way. A methodology of handling city traffic in a very efficient way by proper traffic

management instead of modifying the road infrastructure was studied by Dave and Jhala [3]. This paper presents

the applications of vertex connectivity and edge connectivity in traffic control problems at an intersection so as to

minimize the waiting time of the traffic participants and the cost of locating the sensors for collecting the traffic

www.tjprc.org

editor@tjprc.org

30

Shakera Tanveer

The vehicles approaching an intersection prepare themselves to perform a certain maneuver i.e. to drive through,

turn left, or turn right at an intersection. The vehicles that perform this maneuver represent a flow component. Such an

arrival flow component is called a traffic stream [6]. To study the traffic control problem at an arbitrary intersection, it has

to be modeled mathematically by using a simple graph for the traffic collection data problem. The set of edges of the

underlying graph will represent the communication link between the set of nodes i.e. traffic streams at an intersection. In

the graph representing the traffic control problem, the traffic streams which can move simultaneously at an intersection

without any conflict will be joined by an edge and the streams which cannot move together will not be connected by an

edge. The graph obtained thus is a connected graph and will be referred as the compatibility graph of the intersection

corresponding to the traffic control problem. In order to define a cut-set and the connectivity of the compatibility graph, the

underlying graph G considered as G = (V, E) where V(G) denotes the set of vertices of G and E(G) denotes the set of edges

of G. A cut-set F is a set of edges whose removal from G leaves G disconnected. Also it results in the increase in the

number of components of G by one. Each cut-set of the compatibility graph G consists of a certain number of edges.

The number of edges in the smallest cut-set i.e. the cut-set with fewest numbers of edges is defined as the edge

connectivity of G. The vertex connectivity of the compatibility graph G is defined as the minimum number of vertices

whose removal from G leaves the remaining graph disconnected. The details on these aspects for the graph G can be found

in [2] and [7].

The traffic sensors can be placed on each edge in a cut-set of G determined by its edge connectivity as well as on

each vertex of G determined by its vertex connectivity. The complete traffic information for the control system can be

obtained by using these sensors and their optimal locations for the traffic sensors which can be found by using edge

connectivity and vertex connectivity of the compatibility graph G.

FIRST EXAMPLE

The example considered is a traffic control problem at a four leg intersection, with four streams and the

corresponding compatibility graph as shown in Figures 1 & 2 below are from [3] and [4].

Impact Factor (JCC): 4.6257

31

In the compatibility graph (Figure 2), number of vertices n is 4 and number of edges e is 4. The vertex

connectivity as well as edge connectivity is 2. The edges {b, c} and {a, b} corresponding to the edge connectivity as well

as vertices b and c corresponding to the vertex connectivity whose removal disconnects the compatibility graph.

The disconnected graphs having two components obtained after removing the edges {b, c} and {a, b} as well as vertices b

and c from the compatibility graph are shown below through the Figure 3 and Figure 4 respectively.

Figure 3: Graph obtained after Removal of the Edges {b, c} and {a, b}

From the above discussion it is clear that sensors have to be placed either in the edges {b, c} and {a, b} or in the

vertices b and c, which will provide complete information and can be delivered to the traffic participants, regarding traffic

flow, congestion etc.

SECOND EXAMPLE

Another example considered here is a traffic control problem with seven streams and the corresponding

compatibility graph as shown in Figures 5 & 6 below are from [3, 4] and [8].

www.tjprc.org

editor@tjprc.org

32

Shakera Tanveer

In the compatibility graph (Figure 6), number of vertices n is 7 and number of edges e is 12. The vertex

connectivity as well as edge connectivity is 3. The edges {a, c},{c, d} and{c, g}corresponding to the edge connectivity as

well as vertices c, g and f corresponding to the vertex connectivity whose removal disconnects the compatibility graph.

The disconnected graphs having two components obtained after removing the edges {a, c},{c, d} and{c, g} as well as

vertices d, g and b from the compatibility graph are as shown below in Figure 7 and Figure 8 respectively. Similarly other

pair of vertices and edges can also be found to disconnect the compatibility graph.

Figure 7: Graph obtained after Removal of the Edges {a, c}, {c, d}and {c, g}

APPLICATIONS

The edge connectivity and vertex connectivity have wide application in traffic control problems at an intersection.

The edges given by the edge connectivity and the vertices given by the vertex connectivity determine the exact locations

where the sensors have to be placed which minimizes the total cost and the complete data of the traffic problem can be

obtained by using either of the two connectivitys [2].

33

To study the properties of communication and transportation networks, these connectivitys are of great

importance due to its necessity in finding the maximum rate of flow that is possible from one node to another in the

network. There are many other applications in networks such as network representing roads with traffic capacities, or link

in a computer network with data transmission capacities, or currents in an electric network and also some application in

industrial settings etc.

CONCLUSIONS

In this paper few applications of graph theory are shown with examples. In particular the concept of vertex

connectivity and edge connectivity of a graph can have many different real-world applications and are also used as graph

theoretic tools to study traffic control problem at an intersection. The waiting time of the traffic participants can be

minimized by controlling the edges of the edge connectivity and can be achieved by placing traffic sensors on each such

edges of the edge connectivity of the transportation network which will provide complete information of the traffic

network. As an alternative to above, sensors can also be placed on each vertex of the vertex connectivity of the

transportation network for getting complete traffic information of the network. So, it is concluded that Graph Theory is an

incredibly important part of modern-day life.

REFERENCES

1.

Shamim Ahmed, (2012), Applications of Graph Coloring in modern computer science, Int. J. of Comp. Inf. Tech.,3(2) 1-7.

2.

Arun Kumar Baruah, (2014), Traffic control problems using graph connectivity, Int. J. of Comp. App., 86(11) 1-3.

3.

Darshankumar Dave and Nityangini Jhala, Application of Graph Theory in Traffic Management, Int. J. of Engg. and

Innovative Tech. Vol. 3(12) 2014, 124-126.

4.

Mohsen Hosseini, S. and Oroogi, H.(2009), Phasing of Traffic Lights at a Road Junction, Appl. Math. Sci., 3(30) 1487-1492

5.

Shirinivas, S.G. , Vetrivel, S. and Elango, M.,(2010), Applications of Graph Theory in computer Science review, Int. J. of

Engg. Sci. and Tech., 2(9) 4610-4621

6.

Guberinic, S., Senborn, G., Lazic, B. (2008), Optimal Traffic Control Urban Intersection, CRC Press.

7.

Deo, N., (2000), Graph Theory with Applications to Engineering and Computer Science, Prentice Hall Inc., New Jersey.

8.

Balakrishnan, R., Ranganathan, K. (2012), A text book of Graph Theory, Second Edition, Springer, New York.

www.tjprc.org

editor@tjprc.org

- Graph TheoryUploaded bySanjana Ganesh
- 10.1109@APAP.2011.6180431Uploaded byNirmal mehta
- Lowell W. Beineke & Robin J. Wilson & Peter J. Cameron - Topics in Algebraic Graph TheoryUploaded byÖzkan Yılmaz
- Pr Maths Yr6 2010Uploaded byjas02h1
- Oblong Mean Prime Labeling of Some Tree GraphsUploaded byEditor IJTSRD
- A NOTE ON NON SPLIT LOCATING EQUITABLE DOMINATIONUploaded byiiradmin
- YEdUploaded bymmrodrigo17
- Original_ByzantineUploaded byapi-3761983
- Shortest PathUploaded byVaishu Dhanapalan
- Graphs Dec17 2012Uploaded byUsman Ahmed
- GraphsUploaded byminichel
- GraphsUploaded byAnonymous LMaLHTB
- 08. graphIntroUploaded by1dulles
- Role of Adjacency Matrix in Graph TheoryUploaded byInternational Organization of Scientific Research (IOSR)
- 9BWG5HDF-10.1.1.9.945Uploaded byPaula Jiménez
- 370-1-710-1-10-20150123Uploaded byabhishek
- Incremental PagerankUploaded byPeter Lofgren
- [Jural] Are Tumor Cell Lineages Solely Shaped by Mechanical ForcesUploaded byadora
- algoritmiaaUploaded byYolitaBerenizeD.Gonzales
- adaUploaded byabhishekmurthy
- Reference 5REAL-TIME CALCULUS FOR SCHEDULING HARD REAL-TIME SYSTEMSUploaded byaravind_1
- Static vs Dynamic RoutingUploaded byqaidqaid
- 05432913Uploaded byPrem Panigrahi
- 15_1Uploaded byirinarm
- Temporal Consistency Among Five-Sensory Events: Application to Multimedia TechnologyUploaded byAIRCC - IJCNC
- Regular ExpressionsUploaded byseethamrajumukund
- Some Properties of Fuzzy Evidence GraphUploaded byEditor IJRITCC
- H_CUTUploaded byFrans Casilla Nina
- 3 CSE & IT II Year -- Revised as on 10-08-2016Uploaded byPurushothama Reddy
- SKEMA P2 INTERVENSI 2011Uploaded byNursyahirah Ahmad

- 86IJMPERDJUN201986.pdfUploaded byTJPRC Publications
- 61IJMPERDJUN201961Uploaded byTJPRC Publications
- 39IJMPERDJUN201939Uploaded byTJPRC Publications
- 36IJMPERDJUN201936Uploaded byTJPRC Publications
- 40.IJMPERDJUN201940Uploaded byTJPRC Publications
- 83IJMPERDJUN201983Uploaded byTJPRC Publications
- 57IJMPERDJUN201957Uploaded byTJPRC Publications
- 66.IJMPERDJUN201966Uploaded byTJPRC Publications
- 62IJMPERDJUN201962Uploaded byTJPRC Publications
- 42IJMPERDJUN201942Uploaded byTJPRC Publications
- 41.IJMPERDJUN201941Uploaded byTJPRC Publications
- 64.IJMPERDJUN201964Uploaded byTJPRC Publications
- 83IJMPERDJUN201983Uploaded byTJPRC Publications
- 69.IJMPERDJUN201969Uploaded byTJPRC Publications
- 47IJMPERDJUN201947Uploaded byTJPRC Publications
- 32IJMPERDJUN201932Uploaded byTJPRC Publications
- 32IJMPERDJUN201932Uploaded byTJPRC Publications
- 28.IJMPERDJUN201928Uploaded byTJPRC Publications
- 24IJMPERDJUN201924Uploaded byTJPRC Publications
- 19IJMPERDJUN201919Uploaded byTJPRC Publications
- 26IJMPERDJUN201926Uploaded byTJPRC Publications
- 35IJMPERDJUN201935Uploaded byTJPRC Publications
- 16IJMPERDJUN201916Uploaded byTJPRC Publications
- 22.IJMPERDJUN201922Uploaded byTJPRC Publications
- 18IJMPERDJUN201918Uploaded byTJPRC Publications
- 21.IJMPERDJUN201921Uploaded byTJPRC Publications
- 20IJMPERDJUN201920Uploaded byTJPRC Publications
- 27.IJMPERDJUN201927Uploaded byTJPRC Publications
- 15.IJMPERDJUN201915Uploaded byTJPRC Publications
- 34IJMPERDJUN201934Uploaded byTJPRC Publications

- DUAL RSAUploaded bylala1979
- Hadamard TransformUploaded byIon Capcanari
- mcs-033-IgnouAssignmentGuru 2017-2018.pdfUploaded byAnonymous yDJEp43u
- Lesson Plan PplUploaded byAnonymous 0A4e4rcau1
- Java Basic Data TypesUploaded bymudassir2640
- Knapsack Problem HandoutUploaded byFeynman Liang
- slides01shkeneUploaded byh3492708
- dc09_showUploaded bySoumitra Sulav
- CS4800_SU1_15_Assignment_1Uploaded byPhạm Huy Hoàng
- Google InterviewUploaded byVipul Aggarwal
- 002.Ldpc Final 1Uploaded byPadma Amancha
- Chess AI - Pseudo CodeUploaded byVaibhav Bahadur
- Comp Project - CopyUploaded byAnkur Upadhyay
- Performance Analysis between PSO and Deer Algorithms (DA)Uploaded byAnonymous vQrJlEN
- Error Control Coding Shu Lin PDFUploaded byShela
- Algorithm Design SlidesUploaded byThangNgô
- L5-6 - Feedforward Neural Networks - MLP and RBF_v2Uploaded byzonglif
- Associative Memory Final STHBPqEmIPUploaded bysimran chauhan
- Tcs Paper SolnUploaded byNilesh Patil
- !381notes NewUploaded byeroui331
- 07 Fuzzy SystemsUploaded bySaddy Maddy
- Digital ExamUploaded bysameer
- Maintenance Scheduling of Fighter Aircraft Fleet With Multi-Objective Simulation-OptimizationUploaded byGcmarshall82
- Chapter 7 More About PolynomialsUploaded byapi-3704862
- 1236.pdfUploaded bysrinjoy chakravorty
- Clause ConversionUploaded byArnab Roy
- Graph Theory & Combinatorics Jun 2010Uploaded byPrasad C M
- implementing graph data base basedUploaded byNastase Daniela Ecaterina
- Theory of Computation-2 MarksUploaded bykrishnareddy56
- Discrete MATHS - Slides for Tutorial - Necessary and SufficientUploaded bySunanda Bansal