Skip to main content

Network Model of the Shortest Path Selection in Transport

  • Conference paper
Telematics - Support for Transport (TST 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 471))

Included in the following conference series:

  • 1555 Accesses

Abstract

The network models are often used to solve transport problems. In this paper authors propose such application in the field of finding optimal path in transport. Furthermore, a comparison with other known methods is described. This paper touches only the theoretical aspect of transport problems, but the results can be successfully applied to real transport systems.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dechter, R., Pearl, J.: Generalized best-search strategies and the optimality of A*. Journal of the ACM 32(3), 505–536 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dramski, M.: Shortest path problem in static navigation situations. Metody Informatyki Stosowanej 5 (2011)

    Google Scholar 

  4. Dramski, M.: A comparison between Dijkstra and SACO algorithms in navigation. In: Explo-Ship Conference (2012)

    Google Scholar 

  5. Dramski, M., Mąka, M.: Selected shortest path in the graph algorithms with a use of trapezoidal grid in navigation in restricted area. Archives of Transport System Telematics 5, 3–7 (2012)

    Google Scholar 

  6. Dramski, M., Mąka, M.: Algorithm of solving collision problem of two objects in restricted area. In: Mikulski, J. (ed.) TST 2013. CCIS, vol. 395, pp. 251–257. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Mąka, M.: The recurrent algorithm for area discretization using the trapezoidal mesh method. Zeszyty Naukowe AM w Szczecinie 29(101), 134–139 (2012)

    Google Scholar 

  8. Wilson, R.J.: Wprowadzenie do teorii grafów. PWN, Warszawa (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dramski, M., Mąka, M., Uchacz, W. (2014). Network Model of the Shortest Path Selection in Transport. In: Mikulski, J. (eds) Telematics - Support for Transport. TST 2014. Communications in Computer and Information Science, vol 471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45317-9_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45317-9_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45316-2

  • Online ISBN: 978-3-662-45317-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics