IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-031-57603-4_20.html
   My bibliography  Save this book chapter

Two-Stage Stochastic Optimization for the Extended Aircraft Arrival Management Problem Under Uncertainty

In: Combinatorial Optimization and Applications

Author

Listed:
  • Fabian Bastin

    (Université de Montréal)

  • Sonia Cafieri

    (Université de Toulouse)

  • Ahmed Khassiba

    (Capgemini Engineering)

  • Marcel Mongeau

    (Université de Toulouse)

Abstract

This chapter reviews recent developments to manage aircraft arrivals in the context of extended arrival manager systems, for which uncertainty is significant when predicting expected times to start the approach phase and landing times. An original high-level multi-stage stochastic optimization formulation, considering several air network points of interest, is first introduced taking account of practical operational constraints. The remaining of the chapter focuses on the two-stage special case, which corresponds to recent studies on the aircraft arrival management problem. A landing order is decided at a specific air network point known as the initial approach fix, or IAF (first stage), and a recourse cost is proposed so as to ensure that aircraft separation constraints are satisfied at the landing runway (second stage). Multiple possible IAF points are considered as well as the possibility to delay the departure of on-ground aircraft. Finally, this study proposes new analyses (validation score and impact of inclusion of chance constraints in the first stage) of numerical experiments performed on realistic instances based on Paris-Charles de Gaulle arrival data. We discuss numerical results and exhibit that the stochastic solutions are more robust than their deterministic counterparts.

Suggested Citation

  • Fabian Bastin & Sonia Cafieri & Ahmed Khassiba & Marcel Mongeau, 2024. "Two-Stage Stochastic Optimization for the Extended Aircraft Arrival Management Problem Under Uncertainty," International Series in Operations Research & Management Science, in: Teodor Gabriel Crainic & Michel Gendreau & Antonio Frangioni (ed.), Combinatorial Optimization and Applications, pages 479-506, Springer.
  • Handle: RePEc:spr:isochp:978-3-031-57603-4_20
    DOI: 10.1007/978-3-031-57603-4_20
    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.

    More about this item

    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:isochp:978-3-031-57603-4_20. 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.