Skip to main content
SpringerLink
Log in

Urban Transport and Traffic Systems: An Approach to the Shortest Path Problem and Network Flow Through Colored Graphs

  • Chapter
  • First Online:
Book cover Smart and Digital Cities

Part of the book series: Urban Computing ((UC))

Abstract

Urban transport systems generally present complex topologies and constraints, and consequently model them and propose solutions that are not simple. Because of the importance of proposing solutions that improve urban mobility and the people’s quality of life, in this work, we propose two algorithms applicable to transport network and traffic systems. The first algorithm approaches the shortest path problem in colored graphs. In this case, the graphs’ coloration is used in a different and innovative form: each transport mode is represented by a color (label) and various edges exist between two nodes of the graph (each edge represents a transport mode). The second algorithm, in addition to the coloration used to find the shortest path, considers the multimodal flow network problem by an incremental process. Some examples are presented and the behavior of both algorithms is shown.

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

Access this chapter

Log in via an institution
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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    The number above the arrow at each edge indicates the mode of transport used to traverse it.

References

  1. Abbaspour, R.A., Samadzadegan, F.: An evolutionary solution for multimodal shortest path problem in metropolises. Comput. Sci. Inf. Syst. 7(4), 1–24 (2010)

    Article  Google Scholar 

  2. Ahuja, T.L., Magnanti, R.K.: Network Flows. Prentice Hall, Philadelphia (1993)

    MATH  Google Scholar 

  3. Bellman, R.E.: On a routing problem. Q. Appl. Math. 16, 87–90 (1958)

    Article  Google Scholar 

  4. Bieli, M., Boumakoul, A., Mouncif, H.: Object modeling and path computation for multimodal travel systems. Eur. J. Oper. Res. 175, 1705–1730 (2006)

    Article  Google Scholar 

  5. Brito, J., Martínez, F.J., Moreno, J.A., Verdegay, J.L.: Fuzzy approach for vehicle routing problems with fuzzy travel time. In: International Conference on Fuzzy Systems, Barcelona (2010)

    Google Scholar 

  6. Bureau of Public Roads, Traffic assignment manual. Tech. Report, U.S. Department of Commerce, 1964

    Google Scholar 

  7. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MathSciNet  Google Scholar 

  8. Dubois, D., Prade, H.: Fuzzy Sets and Systems: Theory and Applications. Academic, New York (1980)

    MATH  Google Scholar 

  9. Golnarkar, A., Alesheikh, A.A., Malek, M.R.: Solving best path on multimodal transportation networks with fuzzy costs. Iran. J. Fuzzy Syst. 7(3), 1–13 (2010)

    MathSciNet  MATH  Google Scholar 

  10. Heid, A., Galvez-Fernandez, C., Habbas, Z., Khadraoui, D.: Solving time-dependent multimodal transport problems using a transfer graph model. Comput. Ind. Eng. 61(2), 391–401 (2010)

    Google Scholar 

  11. Lam, S.K., Srikanthan, T.: Accelerating the K-shortest paths computation in multimodal transportation networks. In: 5th International Conference on Intelligent Transportation Systems, Singapore (2002)

    Google Scholar 

  12. Lillo, F., Schmidt, F.: Optimal paths in real multimodal transportation networks: an appraisal using GIS data from New Zealand and Europe. In: Proceedings of the 45th Annual Conference of the ORSNZ (2010)

    Google Scholar 

  13. Loureiro, C.F.G.: Geração de colunas na solução de problemas de desenhos de redes multimodais de transportes. In: XVII Enc. Nac. de Eng. de Prod., Porto Alegre-RS (1997)

    Google Scholar 

  14. Lozano, A., Storchi, G.: Shortest viable path algorithm in multimodal networks. Transp. Res. 35, 225–241 (2001)

    Google Scholar 

  15. Lozano, A., Storchi, G.: Shortest viable hyperpath in multimodal networks. Transp. Res. Part B 36, 853–874 (2002)

    Article  Google Scholar 

  16. Miller, H.J., Storm, J.D., Bowen, M.: GIS design for multimodal networks analysis. In: GIS/LIS ’95 Annual Conference and Exposition Proceedings of GIS/LIS, Nashville, USA, pp. 750–759 (1995)

    Google Scholar 

  17. Modesti, P., Sciomachen, A.: A utility measure for finding multiobjective shortest paths in urban multimodal transportations networks. Eur. J. Oper. Res. 111, 495–508 (1998)

    Article  Google Scholar 

  18. Mouncif, H., Boulmakoul, A., Chala, M.: Integrating GIS-technology for modelling origin-destination trip in multimodal transportation networks. Int. Arab J. Inf. Tech. 3, 256–263 (2006)

    Google Scholar 

  19. Mouncif, H., Rida, M., Boulmakoul, A.: An efficient multimodal path computation integrated within location based service for transportation networks system (multimodal path computation within LBS). J. Appl. Sci. 11(1), 1–15 (2011)

    Article  MathSciNet  Google Scholar 

  20. Pandian, P., Natarajan, G.: A new method for finding an optimal solution of fully interval integer transportation problems. Appl. Math. Sci. 4(37), 1819–1830 (2010)

    MathSciNet  MATH  Google Scholar 

  21. Qu, L., Chen, Y.: A hybrid MCDM method for route selection of multimodal transportation network. Lect. Notes Comput. Sci. 5263, 374–383 (2008)

    Article  Google Scholar 

  22. Ramazani, H., Shafahi, Y., Seyedabrishami, S.E.: A shortest path problem in an urban transportation network based on driver perceived travel time. Sci. Iranica A 17(4), 285–296 (2010)

    MATH  Google Scholar 

  23. Ramazani, H., Shafahi, Y., Seyedabrishami, S.E.: A fuzzy traffic assignment algorithm based on driver perceived travel time of network links. Sci. Iranica A 18(2), 190–197 (2011)

    Article  Google Scholar 

  24. Verga, J., Yamakami, A., Silva, R.C.: Multimodal transport network problem: classical and innovative approaches. In: Corona, C.C. (ed.) Soft Computing for Sustainability Science, pp. 299–332, 1st edn. Springer, New York (2018)

    Google Scholar 

  25. Viedma, F.E.L.: Coloured-edge graph approach for the modelling of multimodal networks. PhD. Thesis, Auckland University of Technology (2011)

    Google Scholar 

  26. Xin-Bo, W., Gui-Jun, Z., Zhen, H., Hai-Feng, G., Li, Y.: Modeling and implementing research of multimodal transportation network. In: The 1st International Conference on Information Science and Engineering, Nanjing, pp. 2100–2103 (2009)

    Google Scholar 

  27. Yu, H., Lu, F.: A multimodal route planning approach with an improved genetic algorithm. Int. Arch. Photogramm. Remote. Sens. Spat. Inf. Sci. 38(2), 343–348 (2011)

    Google Scholar 

  28. Ziliaskopoulos, A., Wardell, W.: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays. Eur. J. Oper. Res. 125, 486–502 (2000)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Federal University of Paraná, Jandaia do Sul, PR, Brazil

    Juliana Verga Shirabayashi

  2. Department of Systems and Energy, FEEC, University of Campinas, Campinas, SP, Brazil

    Akebo Yamakami

  3. Department of Statistics and Applied Mathematics, Federal University of Ceará, Fortaleza, CE, Brazil

    Ricardo Coelho Silva

  4. Department of Mathematics, State University of Maringá, Maringá, PR, Brazil

    Wesley Vagner Inês Shirabayashi

Authors
  1. Juliana Verga Shirabayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akebo Yamakami
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ricardo Coelho Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wesley Vagner Inês Shirabayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Juliana Verga Shirabayashi .

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Universidade Federal Fluminense, Niterói, Rio de Janeiro, Brazil

    Vitor Nazário Coelho

  2. Instituto de Matemática e Estatística, Universidade do Estado do Rio de Janeiro, Rio de Janeiro, Rio de Janeiro, Brazil

    Igor Machado Coelho

  3. Department of Engineering and Information and Communication Technologies, Universitat Pompeu Fabra, Barcelona, Spain

    Thays A.Oliveira

  4. Institute of Computer Science, Universidade Federal Fluminense, Niterói, Rio de Janeiro, Brazil

    Luiz Satoru Ochi

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Shirabayashi, J.V., Yamakami, A., Silva, R.C., Shirabayashi, W.V.I. (2019). Urban Transport and Traffic Systems: An Approach to the Shortest Path Problem and Network Flow Through Colored Graphs. In: Nazário Coelho, V., Machado Coelho, I., A.Oliveira, T., Ochi, L.S. (eds) Smart and Digital Cities. Urban Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-12255-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-12255-3_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-12254-6

  • Online ISBN: 978-3-030-12255-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation