IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v54y2020i4p897-919.html
   My bibliography  Save this article

Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management

Author

Listed:
  • Ahmed Khassiba

    (École nationale de l'aviation civile (ENAC), Université de Toulouse, 31055 Toulouse Cedex 4, France; Département d'informatique et de recherche opérationnelle (DIRO), Université de Montréal, Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport (CIRRELT), Montréal, Quebec H3T 1J4, Canada)

  • Fabian Bastin

    (Département d'informatique et de recherche opérationnelle (DIRO), Université de Montréal, Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport (CIRRELT), Montréal, Quebec H3T 1J4, Canada)

  • Sonia Cafieri

    (École nationale de l'aviation civile (ENAC), Université de Toulouse, 31055 Toulouse Cedex 4, France;)

  • Bernard Gendron

    (Département d'informatique et de recherche opérationnelle (DIRO), Université de Montréal, Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport (CIRRELT), Montréal, Quebec H3T 1J4, Canada)

  • Marcel Mongeau

    (École nationale de l'aviation civile (ENAC), Université de Toulouse, 31055 Toulouse Cedex 4, France;)

Abstract

The extended aircraft arrival management problem, as an extension of the classic aircraft landing problem, seeks to preschedule aircraft on a destination airport a few hours before their planned landing times. A two-stage stochastic mixed-integer programming model enriched by chance constraints is proposed in this paper. The first-stage optimization problem determines an aircraft sequence and target times over a reference point in the terminal area, called initial approach fix (IAF), so as to minimize the landing sequence length. Actual times over the IAF are assumed to deviate randomly from target times following known probability distributions. In the second stage, actual times over the IAF are assumed to be revealed, and landing times are to be determined in view of minimizing a time-deviation impact cost function. A Benders reformulation is proposed, and acceleration techniques to Benders decomposition are sketched. Extensive results on realistic instances from Paris Charles-de-Gaulle airport show the benefit of two-stage stochastic and chance-constrained programming over a deterministic policy.

Suggested Citation

  • Ahmed Khassiba & Fabian Bastin & Sonia Cafieri & Bernard Gendron & Marcel Mongeau, 2020. "Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management," Transportation Science, INFORMS, vol. 54(4), pages 897-919, July.
    • Handle: RePEc:inm:ortrsc:v:54:y:2020:i:4:p:897-919
    DOI: 10.1287/trsc.2020.0991
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2020.0991
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2020.0991?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Faye, Alain, 2018. "A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes," European Journal of Operational Research, Elsevier, vol. 270(3), pages 1148-1157.
    2. Bruce L. Miller & Harvey M. Wagner, 1965. "Chance Constrained Programming with Joint Constraints," Operations Research, INFORMS, vol. 13(6), pages 930-945, December.
    3. Hamsa Balakrishnan & Bala G. Chandran, 2010. "Algorithms for Scheduling Runway Operations Under Constrained Position Shifting," Operations Research, INFORMS, vol. 58(6), pages 1650-1665, December.
    4. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    5. Dale McDaniel & Mike Devine, 1977. "A Modified Benders' Partitioning Algorithm for Mixed Integer Programming," Management Science, INFORMS, vol. 24(3), pages 312-319, November.
    6. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    7. Kapolke, Manu & Fürstenau, Norbert & Heidt, Andreas & Liers, Frauke & Mittendorf, Monika & Weiß, Christian, 2016. "Pre-tactical optimization of runway utilization under uncertainty," Journal of Air Transport Management, Elsevier, vol. 56(PA), pages 48-56.
    8. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.
    9. A. Charnes & W. W. Cooper, 1963. "Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints," Operations Research, INFORMS, vol. 11(1), pages 18-39, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Cheramin, Meysam & Saha, Apurba Kumar & Cheng, Jianqiang & Paul, Sanjoy Kumar & Jin, Hongyue, 2021. "Resilient NdFeB magnet recycling under the impacts of COVID-19 pandemic: Stochastic programming and Benders decomposition," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    2. Marie-Sklaerder Vié & Nicolas Zufferey & Roel Leus, 2022. "Aircraft landing planning under uncertain conditions," Journal of Scheduling, Springer, vol. 25(2), pages 203-228, April.
    3. Wei Zhang & Kai Wang & Alexandre Jacquillat & Shuaian Wang, 2023. "Optimized Scenario Reduction: Solving Large-Scale Stochastic Programs with Quality Guarantees," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 886-908, July.
    4. Nianyi Wang & Huiling Wang & Shan Pei & Boyu Zhang, 2023. "A Data-Driven Heuristic Method for Irregular Flight Recovery," Mathematics, MDPI, vol. 11(11), pages 1-22, June.
    5. Zhen, Lu & He, Xueting & Zhuge, Dan & Wang, Shuaian, 2024. "Primal decomposition for berth planning under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    6. Guglielmo Lulli & Amedeo Odoni & Bruno F. Santos, 2020. "Introduction to the Special Section: Air Transportation Systems Planning and Operations Under Uncertainty," Transportation Science, INFORMS, vol. 54(4), pages 855-857, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    2. Zhang, Junfeng & Zhao, Pengli & Zhang, Yu & Dai, Ximei & Sui, Dong, 2020. "Criteria selection and multi-objective optimization of aircraft landing problem," Journal of Air Transport Management, Elsevier, vol. 82(C).
    3. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.
    4. Pohl, Maximilian & Artigues, Christian & Kolisch, Rainer, 2022. "Solving the time-discrete winter runway scheduling problem: A column generation and constraint programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 674-689.
    5. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    6. Ahmed Ghoniem & Hanif D. Sherali & Hojong Baik, 2014. "Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 514-530, August.
    7. Murça, Mayara Condé Rocha, 2018. "Collaborative air traffic flow management: Incorporating airline preferences in rerouting decisions," Journal of Air Transport Management, Elsevier, vol. 71(C), pages 97-107.
    8. Guépet, Julien & Briant, Olivier & Gayon, Jean-Philippe & Acuna-Agost, Rodrigo, 2017. "Integration of aircraft ground movements and runway operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 104(C), pages 131-149.
    9. Dixit, Aasheesh & Jakhar, Suresh Kumar, 2021. "Airport capacity management: A review and bibliometric analysis," Journal of Air Transport Management, Elsevier, vol. 91(C).
    10. Anna Kwasiborska & Jacek Skorupski, 2021. "Assessment of the Method of Merging Landing Aircraft Streams in the Context of Fuel Consumption in the Airspace," Sustainability, MDPI, vol. 13(22), pages 1-18, November.
    11. Bilsel, R. Ufuk & Ravindran, A., 2011. "A multiobjective chance constrained programming model for supplier selection under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1284-1300, September.
    12. Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
    13. Bo Xu & Weimin Ma & Hui Huang & Lei Yue, 2016. "Weighted Constrained Position Shift Model for Aircraft Arrival Sequencing and Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-22, August.
    14. Chandra, Aitichya & Choubey, Nipun & Verma, Ashish & Sooraj, K.P., 2024. "Quasi-stochastic optimization model for time-based arrival scheduling considering Standard Terminal Arrival (STAR) track time and a new delay-conflict relationship," Journal of Air Transport Management, Elsevier, vol. 115(C).
    15. O. Olesen, 2006. "Comparing and Combining Two Approaches for Chance Constrained DEA," Journal of Productivity Analysis, Springer, vol. 26(2), pages 103-119, October.
    16. Pavlo Glushko & Csaba I. Fábián & Achim Koberstein, 2022. "An L-shaped method with strengthened lift-and-project cuts," Computational Management Science, Springer, vol. 19(4), pages 539-565, October.
    17. Xiao Liu & Simge Küçükyavuz, 2018. "A polyhedral study of the static probabilistic lot-sizing problem," Annals of Operations Research, Springer, vol. 261(1), pages 233-254, February.
    18. Maji, Chandi Charan, 1975. "Intertemporal allocation of irrigation water in the Mayurakshi Project (India): an application of deterministic and chance-constrained linear programming," ISU General Staff Papers 197501010800006381, Iowa State University, Department of Economics.
    19. Salehipour, Amir, 2020. "An algorithm for single- and multiple-runway aircraft landing problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 175(C), pages 179-191.
    20. Zhang, Haoyang & Zhan, Sen & Kok, Koen & Paterakis, Nikolaos G., 2024. "Establishing a hierarchical local market structure using multi-cut Benders decomposition," Applied Energy, Elsevier, vol. 363(C).

    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:inm:ortrsc:v:54:y:2020:i:4:p:897-919. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.