IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v6y2019ics2214716018301854.html
   My bibliography  Save this article

Using deficit functions for aircraft fleet routing

Author

Listed:
  • Stern, Helman I.
  • Gertsbakh, Ilya B.

Abstract

We consider the problem of minimizing the number of airplanes needed to fly a fixed daily repeating schedule of flights. We use deficit functions (DF) to decompose an aviation schedule of aircraft flights into aircraft chains (routes) called a chain decomposition. Each chain visits periodically a set of airports and is served by several cockpit crews circulating along the airports of this set. The initial step in our approach is to find the minimal number of aircraft needed to carry out the flight schedule. This is achieved by using the fleet size theorem based on a DF representation of an aircraft flight schedule. A DF is a step function associated with an aircraft terminal which changes by + 1 and −1 at flight departure and arrival times, respectively. DF theory was developed in the 1960–70s by Linis and Maksim (1967) and Gertsbakh and Gurevich (1977). Although the initial application of DFs was to the Russian AEROFLOT fleet it has subsequently attracted more attention on bus scheduling than aircraft scheduling. Here we discuss the revival of this method and its crucial use to construct the so-called chain decomposition of the schedule for a single period. We provide a justification for maximizing the number of balanced chains (flight sequences with the same start and end terminals). To do this we propose The Maximal Balanced Chain Problem. These are then converted into a set of infinite periodic flight sequences, each of which can be carried out by a single aircraft. The conversion is carried out by mapping the single period set of chains into an Euler graph. To construct the set of mutiperiod chains that are “balanced” (return to the same terminal at the start) we find all edge disjoint cycle covers of the Euler graph using a modified version of Hierholzer's algorithm. These cycles are converted back into a balanced multiperiod chain solution and modified to conform to any maintenance constraints. To insure maintenance check constraints are satisfied for multiperiod chains, it may be necessary to add deadhead flights. Minimizing the cost of deadhead trips and overnight stays provide the basis for selecting an optimal routing solution.

Suggested Citation

  • Stern, Helman I. & Gertsbakh, Ilya B., 2019. "Using deficit functions for aircraft fleet routing," Operations Research Perspectives, Elsevier, vol. 6(C).
  • Handle: RePEc:eee:oprepe:v:6:y:2019:i:c:s2214716018301854
    DOI: 10.1016/j.orp.2019.100104
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716018301854
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.orp.2019.100104?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Liu, Tao & (Avi) Ceder, Avishai, 2017. "Deficit function related to public transport: 50 year retrospective, new developments, and prospects," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 1-19.
    2. Jean-François Cordeau & Goran Stojković & François Soumis & Jacques Desrosiers, 2001. "Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling," Transportation Science, INFORMS, vol. 35(4), pages 375-388, November.
    3. I. Gertsbach & Yu. Gurevich, 1977. "Constructing an Optimal Fleet for a Transportation Schedule," Transportation Science, INFORMS, vol. 11(1), pages 20-36, February.
    4. Stojkovic, Goran & Soumis, François & Desrosiers, Jacques & Solomon, Marius M., 2002. "An optimization model for a real-time flight scheduling problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(9), pages 779-788, November.
    5. Ilya Gertsbakh & Helman I. Stern, 1978. "Minimal Resources for Fixed and Variable Job Schedules," Operations Research, INFORMS, vol. 26(1), pages 68-85, February.
    6. Chiwei Yan & Jerry Kung, 2018. "Robust Aircraft Routing," Transportation Science, INFORMS, vol. 52(1), pages 118-133, January.
    7. Mark S. Daskin & Nicholaos D. Panayotopoulos, 1989. "A Lagrangian Relaxation Approach to Assigning Aircraft to Routes in Hub and Spoke Networks," Transportation Science, INFORMS, vol. 23(2), pages 91-99, May.
    8. 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.
    9. Gertsbakh, I. & Gurevich, Yuri, 1982. "Homogeneous optimal fleet," Transportation Research Part B: Methodological, Elsevier, vol. 16(6), pages 459-470, December.
    10. Lloyd Clarke & Ellis Johnson & George Nemhauser & Zhongxi Zhu, 1997. "The aircraft rotation problem," Annals of Operations Research, Springer, vol. 69(0), pages 33-46, January.
    11. Avishai Ceder & Helman I. Stern, 1981. "Deficit Function Bus Scheduling with Deadheading Trip Insertions for Fleet Size Reduction," Transportation Science, INFORMS, vol. 15(4), pages 338-363, November.
    12. Gertsbakh, Ilya & Serafini, Paolo, 1991. "Periodic transportation schedules with flexible departure times : An interactive approach based on the periodic event scheduling problem and the deficit function approach," European Journal of Operational Research, Elsevier, vol. 50(3), pages 298-309, February.
    13. Mohamed Haouari & Shengzhi Shao & Hanif D. Sherali, 2013. "A Lifted Compact Formulation for the Daily Aircraft Maintenance Routing Problem," Transportation Science, INFORMS, vol. 47(4), pages 508-525, November.
    14. Lacasse-Guay, Eve & Desaulniers, Guy & Soumis, François, 2010. "Aircraft routing under different business processes," Journal of Air Transport Management, Elsevier, vol. 16(5), pages 258-263.
    15. 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.
    16. 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.
    17. 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.
    18. T. E. Bartlett, 1957. "An algorithm for the minimum number of transport units to maintain a fixed schedule," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 4(2), pages 139-149, June.
    19. 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.
    20. Ben Ahmed, Mohamed & Zeghal Mansour, Farah & Haouari, Mohamed, 2018. "Robust integrated maintenance aircraft routing and crew pairing," Journal of Air Transport Management, Elsevier, vol. 73(C), pages 15-31.
    21. James B. Orlin, 1982. "Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets," Operations Research, INFORMS, vol. 30(4), pages 760-776, August.
    22. G. B. Dantzig & D. R. Fulkerson, 1954. "Minimizing the number of tankers to meet a fixed schedule," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(3), pages 217-222, September.
    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. Radislav Vaisman & Ilya B. Gertsbakh, 2023. "Optimal balanced chain decomposition of partially ordered sets with applications to operating cost minimization in aircraft routing problems," Public Transport, Springer, vol. 15(1), pages 199-225, March.
    2. Saltzman, Robert M. & Stern, Helman I., 2022. "The multi-day aircraft maintenance routing problem," Journal of Air Transport Management, Elsevier, vol. 102(C).

    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. Saltzman, Robert M. & Stern, Helman I., 2022. "The multi-day aircraft maintenance routing problem," Journal of Air Transport Management, Elsevier, vol. 102(C).
    2. 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).
    3. 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.
    4. Parmentier, Axel & Meunier, Frédéric, 2020. "Aircraft routing and crew pairing: Updated algorithms at Air France," Omega, Elsevier, vol. 93(C).
    5. Xiao, Fan & Guo, Siqi & Huang, Lin & Huang, Lei & Liang, Zhe, 2022. "Integrated aircraft tail assignment and cargo routing problem with through cargo consideration," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 328-351.
    6. 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.
    7. 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.
    8. Maher, Stephen J. & Desaulniers, Guy & Soumis, François, 2018. "The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints," European Journal of Operational Research, Elsevier, vol. 264(2), pages 534-547.
    9. 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.
    10. 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.
    11. Liu, Tao & (Avi) Ceder, Avishai, 2017. "Deficit function related to public transport: 50 year retrospective, new developments, and prospects," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 1-19.
    12. Mohamed Haouari & Shengzhi Shao & Hanif D. Sherali, 2013. "A Lifted Compact Formulation for the Daily Aircraft Maintenance Routing Problem," Transportation Science, INFORMS, vol. 47(4), pages 508-525, November.
    13. He, Yonghuan & Ma, Hoi-Lam & Park, Woo-Yong & Liu, Shi Qiang & Chung, Sai-Ho, 2023. "Maximizing robustness of aircraft routing with heterogeneous maintenance tasks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Cynthia Barnhart & Amr Farahat & Manoj Lohatepanont, 2009. "Airline Fleet Assignment with Enhanced Revenue Modeling," Operations Research, INFORMS, vol. 57(1), pages 231-244, February.

    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:eee:oprepe:v:6:y:2019:i:c:s2214716018301854. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/operations-research-perspectives .

    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.