IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-89920-6_1.html
   My bibliography  Save this book chapter

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

In: Operations Research Proceedings 2017

Author

Listed:
  • Adam Schienle

    (Zuse Institute Berlin)

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.

Suggested Citation

  • Adam Schienle, 2018. "Solving the Time-Dependent Shortest Path Problem Using Super-Optimal Wind," Operations Research Proceedings, in: Natalia Kliewer & Jan Fabian Ehmke & Ralf Borndörfer (ed.), Operations Research Proceedings 2017, pages 3-9, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-89920-6_1
    DOI: 10.1007/978-3-319-89920-6_1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ralf Borndörfer & Fabian Danecker & Martin Weiser, 2023. "Error Bounds for Discrete-Continuous Free Flight Trajectory Optimization," Journal of Optimization Theory and Applications, Springer, vol. 198(2), pages 830-856, August.

    More about this item

    Keywords

    Time-dependent shortest path; A* algorithm;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-89920-6_1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.