IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_42.html
   My bibliography  Save this book chapter

A Time-Flow Approach for Scheduling and Routing of Fly-in Safari Airplanes

In: Operations Research Proceedings 2018

Author

Listed:
  • Fabian Gnegel

    (Brandenburg Technical University Cottbus-Senftenberg)

  • Armin Fügenschuh

    (Brandenburg Technical University Cottbus-Senftenberg)

Abstract

A touristic company that offers fly-in safaris is faced with the challenge to route and schedule its fleet of aircrafts in an optimal way. Over the course of a given time horizon several groups of tourists have to be picked up at airports and flown to their destinations within a certain time window. Furthermore the number of available seats, the consumption of fuel, the maximal takeoff weight, and restrictions on the detour of the individual groups have to be taken into account. A flow-over-flow formulation on the time expanded graph of the airports was used in the literature in combination with a so called time-free relaxation in order to solve this problem with a solver for MILP. We give an alternative MILP formulation of the problem, that still allows for similar relaxation techniques to be used. This formulation, however, also allows for the construction of graphs which can be interpreted as intermediate graphs between the time-free and the (totally) time-expanded graph and therefore yield stronger relaxations. With knowledge obtained from the solutions of these relaxations the number of vertices that have to be expanded in order to guarantee feasibility is reduced significantly. On the benchmark set this lead to a decrease of the average computation time and a significant reduction of the remaining optimality gaps.

Suggested Citation

  • Fabian Gnegel & Armin Fügenschuh, 2019. "A Time-Flow Approach for Scheduling and Routing of Fly-in Safari Airplanes," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 339-345, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_42
    DOI: 10.1007/978-3-030-18500-8_42
    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.

    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-030-18500-8_42. 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.