IDEAS home Printed from https://ideas.repec.org/a/wly/jjmath/v2022y2022i1n8806135.html

A Game‐Theoretic Approach for the Robust Daily Aircraft Routing Problem

Author

Listed:
  • Bin Deng
  • Hao Guo
  • Jingfeng Li
  • Junfeng Huang
  • Kaiyi Tang
  • Weidong Li

Abstract

In the operation of airlines, the most important link is determining the route and scheduling of aircraft. The key to this problem is to input the flight segment and aircraft type and finally determine all flight segments for each aircraft. In this paper, we focus on finding feasible, robust scheduling for various uncertainties in the flight process. This paper presents a new robust integer mathematical model based on game theory that considers daily aircraft routing. Then, in order to find the suboptimal solution to a large‐scale integer programming problem in a limited amount of time, a heuristic algorithm integrating a column generation algorithm and variable domain search is introduced. In addition, we use the data of a Chinese airline to verify, and the experimental results show that the model proposed by us is more robust than the model in general.

Suggested Citation

  • Bin Deng & Hao Guo & Jingfeng Li & Junfeng Huang & Kaiyi Tang & Weidong Li, 2022. "A Game‐Theoretic Approach for the Robust Daily Aircraft Routing Problem," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:jjmath:v:2022:y:2022:i:1:n:8806135
    DOI: 10.1155/2022/8806135
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/8806135
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/8806135?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. Jamili, Amin, 2017. "A robust mathematical model and heuristic algorithms for integrated aircraft routing and scheduling, with consideration of fleet assignment problem," Journal of Air Transport Management, Elsevier, vol. 58(C), pages 21-30.
    2. Guy Desaulniers & Jacques Desrosiers & Yvan Dumas & Marius M. Solomon & François Soumis, 1997. "Daily Aircraft Routing and Scheduling," Management Science, INFORMS, vol. 43(6), pages 841-855, June.
    3. G. A. Croes, 1958. "A Method for Solving Traveling-Salesman Problems," Operations Research, INFORMS, vol. 6(6), pages 791-812, December.
    4. Amos Levin, 1971. "Scheduling and Fleet Routing Models for Transportation Systems," Transportation Science, INFORMS, vol. 5(3), pages 232-255, August.
    5. Cynthia Barnhart & Natashia L. Boland & Lloyd W. Clarke & Ellis L. Johnson & George L. Nemhauser & Rajesh G. Shenoi, 1998. "Flight String Models for Aircraft Fleeting and Routing," Transportation Science, INFORMS, vol. 32(3), pages 208-220, August.
    6. Laporte, Gilbert & Mesa, Juan A. & Perea, Federico, 2010. "A game theoretic framework for the robust railway transit network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 447-459, May.
    Full references (including those not matched with items on IDEAS)

    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. Shan Lan & John-Paul Clarke & Cynthia Barnhart, 2006. "Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions," Transportation Science, INFORMS, vol. 40(1), pages 15-28, February.
    2. Belanger, Nicolas & Desaulniers, Guy & Soumis, Francois & Desrosiers, Jacques, 2006. "Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1754-1766, December.
    3. Khaled, Oumaima & Minoux, Michel & Mousseau, Vincent & Michel, Stéphane & Ceugniet, Xavier, 2018. "A multi-criteria repair/recovery framework for the tail assignment problem in airlines," Journal of Air Transport Management, Elsevier, vol. 68(C), pages 137-151.
    4. Guardo-Martinez, Elisa & Onggo, Stephan & Kunc, Martin & Padrón, Silvia & Tomasella, Maurizio, 2026. "Robust airline scheduling with turnaround under uncertainty: towards collaborative airline scheduling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
    5. Sherali, Hanif D. & Bish, Ebru K. & Zhu, Xiaomei, 2006. "Airline fleet assignment concepts, models, and algorithms," European Journal of Operational Research, Elsevier, vol. 172(1), pages 1-30, July.
    6. Wen, Xin & Sun, Xuting & Ma, Hoi-Lam & Sun, Yige, 2022. "A column generation approach for operational flight scheduling and aircraft maintenance routing," Journal of Air Transport Management, Elsevier, vol. 105(C).
    7. Khaled, Oumaima & Minoux, Michel & Mousseau, Vincent & Michel, Stéphane & Ceugniet, Xavier, 2018. "A compact optimization model for the tail assignment problem," European Journal of Operational Research, Elsevier, vol. 264(2), pages 548-557.
    8. Sanchez, David Torres & Boyacı, Burak & Zografos, Konstantinos G., 2020. "An optimisation framework for airline fleet maintenance scheduling with tail assignment considerations," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 142-164.
    9. Kenan, Nabil & Jebali, Aida & Diabat, Ali, 2018. "The integrated aircraft routing problem with optional flights and delay considerations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 355-375.
    10. F M Zeghal & M Haouari & H D Sherali & N Aissaoui, 2011. "Flexible aircraft fleeting and routing at TunisAir," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 368-380, February.
    11. Saltzman, Robert M. & Stern, Helman I., 2022. "The multi-day aircraft maintenance routing problem," Journal of Air Transport Management, Elsevier, vol. 102(C).
    12. Haouari, Mohamed & Aissaoui, Najla & Mansour, Farah Zeghal, 2009. "Network flow-based approaches for integrated aircraft fleeting and routing," European Journal of Operational Research, Elsevier, vol. 193(2), pages 591-599, March.
    13. João P. Pita & Cynthia Barnhart & António P. Antunes, 2013. "Integrated Flight Scheduling and Fleet Assignment Under Airport Congestion," Transportation Science, INFORMS, vol. 47(4), pages 477-492, November.
    14. Sriram, Chellappan & Haghani, Ali, 2003. "An optimization model for aircraft maintenance scheduling and re-assignment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(1), pages 29-48, January.
    15. Hanif D. Sherali & Ki-Hwan Bae & Mohamed Haouari, 2013. "An Integrated Approach for Airline Flight Selection and Timing, Fleet Assignment, and Aircraft Routing," Transportation Science, INFORMS, vol. 47(4), pages 455-476, November.
    16. Liang, Zhe & Feng, Yuan & Zhang, Xiaoning & Wu, Tao & Chaovalitwongse, Wanpracha Art, 2015. "Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 238-259.
    17. Zhe Liang & Wanpracha Art Chaovalitwongse, 2013. "A Network-Based Model for the Integrated Weekly Aircraft Maintenance Routing and Fleet Assignment Problem," Transportation Science, INFORMS, vol. 47(4), pages 493-507, November.
    18. Hai Jiang & Cynthia Barnhart, 2009. "Dynamic Airline Scheduling," Transportation Science, INFORMS, vol. 43(3), pages 336-354, August.
    19. Michelle Dunbar & Gary Froyland & Cheng-Lung Wu, 2012. "Robust Airline Schedule Planning: Minimizing Propagated Delay in an Integrated Routing and Crewing Framework," Transportation Science, INFORMS, vol. 46(2), pages 204-216, May.
    20. Sarac, Abdulkadir & Batta, Rajan & Rump, Christopher M., 2006. "A branch-and-price approach for operational aircraft maintenance routing," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1850-1869, December.

    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:wly:jjmath:v:2022:y:2022:i:1:n:8806135. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/1469 .

    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.