Signal Time Optimisation for a 3-Legged Urban Intersection in Developing Economies Using Branch and Bound Algorithm

Preview this chapter:

Signal Time Optimisation for a 3-Legged Urban Intersection in Developing Economies Using Branch and Bound Algorithm, Page 1 of 1

< Previous page | Next page > /docserver/preview/fulltext/9789815049077/chap3-1.gif

nbsp;Urban road traffic at the intersection causes severe congestion problems and causes delays for road users. Contending excessive delays at signalized intersections due to traffic flow fluctuations has been recognized as one of the most challenging issues for traffic engineers. The objective of this paper is to compare the conventional signal design method (Ex: Webster and trial cycle method) and sophisticated method using branch and bound algorithm of signal optimization technique. For a long time, traffic delays, recursive branch and bound algorithm techniques prove an important time optimization method of urban three legged regional traffic signal. This paper provides useful information about signal time optimization techniques based on the demographical features and existing traffic conditions and draws a corresponding flow chart. In this article, one of the busiest three legged intersections was selected in the city of Raipur. Practise has proven that in optimisation signal design branch and bound algorithm of signal optimization has better performs in terms of signal optimization cycle length.