• MINIMUM CUT MAXIMUM FLOW OF TRAFFIC IN A TRAFFIC CONTROL PROBLEM

Abstract

Traffic congestion in urban road and freeway network leads to a strong degradation of the network infrastructure and reduce the flow of traffic. The cut-set of a graph can be used to study the most efficient route of a traffic control problem at an intersection. In this paper we have applied minimum cut maximum flow using cut-set of graph to direct the traffic flow to its maximum capacity using the minimum number of edges. This result has got application in traffic control problem at an arbitrary intersection so as to minimize the waiting time of the traffic participants for an uncongested flow and the cost of locating sensors in order to collect traffic data, which provides quantitative measurement of traffic flow.