Modulating Traffic Signal Phases to Realize Real-Time Traffic Control System

This paper proposes innovations to address challenges emanating from road traffic congestion. Improving economies create more car owners resulting in increased automobile manufacturing, increased vehicle population giving rise to higher emission of CO2 resulting in traffic congestion. Congested traffic has idling vehicles which emit higher CO2 and pollution. Besides, traffic congestion increases turnaround time, delivery time, commuting time and related logistical aspects. Commuting time negatively impacts working hours. Unless the traffic congestion is mitigated, the economy will take a beating creating a vicious ecology cycle. Building new roads, bridges or reconditioning of infrastructure is not always the best possible solutions. Efficient traffic management is a key to country’s economic growth. Various analytical models are employed to study, appreciate traffic congestion. The paper studies these models to infer that real time approach is the only solution. Several approaches are being worked on and few commercial systems too are available. These systems provide traffic information for course correction. However, it has latency and hence deviates from real time environment. Traffic congestion being highly dynamic in nature, it necessitates real time solution with real time inputs. It is proposed to integrate Real time traffic data with the traffic signal thus modulating the cycle timings at every junction. Deviation from static asymmetric cycle timing is implemented by assigning green phases based on density of vehicles. With minimalistic infrastructure and negligible incremental cost, the paper not only proposes to address traffic congestion but also paves the way for capturing traffic offenses, vehicle tracking and toll collection. The research is imminently realizable and makes a strong case for a PPP (Public Private Partnership) project.

A Model with Traffic Routers, Dynamically Managing Signal Phases to Address Traffic Congestion in Real Time

On-road Vehicular traffic congestion has detrimental effect on three lifelines: Economy, Productivity and Pollution (EPP). With ever increasing population of vehicles on road, traffic congestion is a major challenge to the economy, productivity and pollution, notwithstanding continuous developments in alternative fuels, alternative sources of energy. The research develops accurate and precise model in real time which computes congestion detection, dynamic signaling algorithm to evenly distribute vehicle densities while ensuring avoidance of starvation and deadlock situation. The model incorporates road segment length and breadth, quality and achievable average speed to compute road capacity. Vehicles installed with GPS enabled devices provide their location, which enables computing road occupancy. Road occupancy is evaluated based on number of vehicles as well as area occupied by vehicles. Ratio of road occupancy and road capacity provides congestion index important to compute signal phases. The algorithm ensures every direction is serviced once during a signaling cycle ensuring no starvation. Secondly, the definition of minimum and maximum signal timings ensures against dead lock situation. A simulator is developed to validate the proposition and proves it can ease congestion by more than 50% which is better than any of the contemporary approaches offering 15% improvement. In case of higher congestion index, alternate routes are suggested based on evaluation of traffic density graphs for shortest route or knowledge database. The algorithm to compute shortest route is optimized drastically, reducing computation cost to 3*√2N vis-à-vis computation cost of N2 by classical algorithms. The proposal brings down the cost of implementation per traffic junction from USD 30,000 to USD 2000.

Shortest Alternate Path Discovery through Recursive Bounding Box Pruning

Congestion is a dynamic phenomenon and hence efficiently computing alternate shortest route can only help expedite decongestion. This research is aimed to efficiently compute shortest path for road traffic network so that congestion can be eased resulting in reduced CO2 emission and improved economy. Congestion detection is achieved after evaluating road capacity and road occupancy. Congestion index, a ratio of road occupancy to road capacity is computed, congestion index higher than 0.6 necessitates computation of alternate shortest route. Various algorithms offer shortest alternate route. The paper discusses minimization of graph based by removing redundant nodes which don’t play a role in computation of shortest path. The proposal is based on continuous definition of a bounding box every time a next neighboring node is considered. This reduces maximum number of contentious nodes repeatedly and optimizes the network. The algorithm is deployed from both the ends sequentially to ensure zero error and validate the shortest path discovery. While discovering shortest path, the algorithm also offers an array of shortest path in ascending order of the path length. However, vehicular traffic exhibits network duality viz. static and dynamic network graphs. Shortest route for static distance graph is pre-computed and stored for look-up, alternate shortest path based on assignment of congestion levels to edge weights is triggered by congestion index. The research also supports directed graphs to address traffic rules for lanes having unidirectional and bidirectional traffic.