APPLICATIONS OF GRAPH COLORING METODS FOR DETERMINING THE MINIMUM NUMBER OF STAGES LIGHT CONTROLLED INTERSECTIONS
Keywords:
intersection, phase, traffic flow, graph, nodeAbstract
The article discusses possible approaches to solving the problem to find the minimum number of phases required to drive light controlled intersections. The introductory chapters are described and discussed approaches (heuristic and exact), which can be used to solve the problem. In the next chapter, these approaches are applied to obtain solutions at the real intersection, and final chapter compares the advantages and disadvantages of using different approaches.
Downloads
Download data is not yet available.
References
(1) ČERNÁ, A; ČERNÝ, J. Teorie řízení a rozhodování v dopravních systémech.
Pardubice: Univerzita Pardubice, 2004. 150 s. ISBN 80-86530-15-9.
(2) Algoritmické teorie grafů [online]. [cit. 2009-12-02].
Dostupné z <http://frcatel.fri.uniza.sk/users/paluch/grafy.pdf>
(3) Google.cz, [online]. [cit. 2010-03-12]
Dostupné z http://www.google.cz.
Pardubice: Univerzita Pardubice, 2004. 150 s. ISBN 80-86530-15-9.
(2) Algoritmické teorie grafů [online]. [cit. 2009-12-02].
Dostupné z <http://frcatel.fri.uniza.sk/users/paluch/grafy.pdf>
(3) Google.cz, [online]. [cit. 2010-03-12]
Dostupné z http://www.google.cz.
Downloads
Published
2011-04-15
How to Cite
Rusek, M. (2011). APPLICATIONS OF GRAPH COLORING METODS FOR DETERMINING THE MINIMUM NUMBER OF STAGES LIGHT CONTROLLED INTERSECTIONS. Perner’s Contacts, 6(1), 275–285. Retrieved from https://pernerscontacts.upce.cz/index.php/perner/article/view/803
Issue
Section
Articles
License
Copyright (c) 2020 Michal Rusek
This work is licensed under a Creative Commons Attribution 4.0 International License.
