Skip to main content

Efficient Traffic Management on Road Network Using Edmonds–Karp Algorithm

  • Conference paper
  • First Online:
Progress in Advanced Computing and Intelligent Engineering

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 714))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  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 

Download references

Acknowledgments

We would like to thank our colleagues from our institution for providing deeper insights and expertise that helped our research to great extent.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. Rajalakshmi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rajalakshmi, V., Ganesh Vaidyanathan, S. (2019). Efficient Traffic Management on Road Network Using Edmonds–Karp Algorithm. In: Panigrahi, C., Pujari, A., Misra, S., Pati, B., Li, KC. (eds) Progress in Advanced Computing and Intelligent Engineering. Advances in Intelligent Systems and Computing, vol 714. Springer, Singapore. https://doi.org/10.1007/978-981-13-0224-4_52

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-0224-4_52

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0223-7

  • Online ISBN: 978-981-13-0224-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics