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

Adam Schienle ()
Additional contact information
Adam Schienle: Zuse Institute Berlin

A chapter in Operations Research Proceedings 2017, 2018, pp 3-9 from Springer

Abstract: 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.

Keywords: Time-dependent shortest path; A* algorithm (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_1

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_1

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().