Efficient Traffic Management on Road Network Using Edmonds–Karp Algorithm
Consequential magnification in urbanization over the past decades has brought in an immense burden on city transportation system. Traffic congestion is a vital problem that increments queuing of conveyances on roads and brings in delay in our daily routine. The motivation of this research work is to address this problem by developing a Traffic Management System utilizing Edmonds–Karp algorithm. Edmonds–Karp algorithm is a network flow algorithm that is used to find the various routes to divert and regulate traffic flow during traffic congestion. The Traffic Management System is efficient by executing the Edmonds–Karp algorithm on small road networks in parallel that reduces the computation cost of finding the maximum flow in the network.
KeywordsAugmenting path Parallelization Breadth first search Edmonds–Karp algorithm and traffic management system
We would like to thank our colleagues from our institution for providing deeper insights and expertise that helped our research to great extent.
- 1.Khaled Rabieh, Mohamed M. E. A. Mahmoud, Mohamed Younis: Privacy-Preserving Route Reporting Schemes for Traffic Management Systems. IEEE Transaction on Vehicular Technology. Vol. 66 (3). (2017) 2703–2713.Google Scholar
- 2.Otsuki. K, Kobayashi. Y, Murota. K:Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network. Eur. J. Oper. Res. 248(2), 396–403 (2016).Google Scholar
- 3.Elisa Valentina Moisi, Benedek Nagy, Vladimir loan Cretu: Maximum flow minimum cost algorithm for reconstruction of images represented on triangular grids. IEEE 8th International Symposium on Applied Computational Intelligence and Infomatics. (2013) 35–40.Google Scholar
- 4.Dancoisne. B, Dupont. E, Zhang. W: Distributed max-flow in spark (2015).Google Scholar