Skip to main content

Solving the Time-Dependent Shortest Path Problem Using Super-Optimal Wind

  • Conference paper
  • First Online:
  • 1948 Accesses

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

Planning efficient routes fast becomes ever more important, especially in the context of aircraft trajectories. As time-dependent wind conditions factor into the shortest path query, we use an artificial wind vector called Super-Optimal Wind as a means of creating a suitable potential function for the A* algorithm, thus speeding up the query. We assess the quality of Super-Optimal Wind both theoretically and computationally, and use Super-Optimal Wind in a real-world instance.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.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

Learn about institutional subscriptions

Notes

  1. 1.

    Speed relative to the surrounding air mass.

References

  1. Air Transport Action Group (ATAG). (2017). Facts and figures. http://www.atag.org/facts-and-figures.html. Retrived 07 Aug 2017.

  2. Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2015). Route planning in transportation networks. Technical report, Microsoft Research. Updated version of the technical report MSR-TR-2014-4.

    Google Scholar 

  3. Blanco, M., Borndörfer, R., Hoang, N. D., Kaier, A., Schienle, A., Schlechte, T., & Sclobach, S. (2016). Solving time dependent shortest path problems on airway networks using super-optimal wind. 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016), 54. (epub ahead of print).

    Google Scholar 

  4. Goldberg, A. V., & Harrelson, C. (2004). Computing the shortest path: A* search meets graph theory. Technical Report MSR-TR-2004-24, Microsoft Research, Vancouver, Canada, July 2004.

    Google Scholar 

  5. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4, 100–107.

    Article  Google Scholar 

  6. International Air Transport Association. IATA Price Analysis. (2017). https://www.iata.org/publications/economics/fuel-monitor/Pages/price-analysis.aspx. Retrived 07 Aug 2017.

  7. Lufthansa Group. (2017). Balance – Nachhaltigkeitsbericht der Lufthansa Group 2016. https://www.lufthansagroup.com/fileadmin/downloads/de/verantwortung/LH-Nachhaltigkeitsbericht-2017.pdf. Retrived 07 Aug 2017.

  8. Schienle, A. (2016). Shortest paths on airway networks. Master’s thesis, Freie Universitt Berlin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Adam Schienle .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Schienle, A. (2018). Solving the Time-Dependent Shortest Path Problem Using Super-Optimal Wind. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_1

Download citation

Publish with us

Policies and ethics