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

Flight String Models for Aircraft Fleeting and Routing

Author

Listed:
  • Cynthia Barnhart

    (Center for Transportation Studies, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • Natashia L. Boland

    (Department of Mathematics, University of Melbourne, Parkville VIC 3052 Australia)

  • Lloyd W. Clarke

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205)

  • Ellis L. Johnson

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205)

  • George L. Nemhauser

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205)

  • Rajesh G. Shenoi

    (McKinsey & Company, 2 Houston Center, Suite 3500, Houston, Texas 77010)

Abstract

Given a schedule of flight legs to be flown by an airline, the fleet assignment problem is to determine the minimum cost assignment of flights to aircraft types, called fleets, such that each scheduled flight is assigned to exactly one fleet, and the resulting assignment is feasible to fly given a limited number of aircraft in each fleet. Then the airline must determine a sequence of flights, or routes, to be flown by individual aircraft such that assigned flights are included in exactly one route, and all aircraft can be maintained as necessary. This is referred to as the aircraft routing problem. In this paper, we present a single model and solution approach to solve simultaneously the fleet assignment and aircraft routing problems. Our approach is robust in that it can capture costs associated with aircraft connections and complicating constraints such as maintenance requirements. By setting the number of fleets to one, our approach can be used to solve the aircraft routing problem alone. We show how to extend our model and solution approach to solve aircraft routing problems with additional constraints requiring equal aircraft utilization. With data provided by airlines, we provide computational results for the combined fleet assignment and aircraft routing problems without equal utilization requirements and for aircraft routing problems requiring equal aircraft utilization.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:ortrsc:v:32:y:1998:i:3:p:208-220
    DOI: 10.1287/trsc.32.3.208
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.32.3.208
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.32.3.208?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. L. W. Clarke & C. A. Hane & E. L. Johnson & G. L. Nemhauser, 1996. "Maintenance and Crew Considerations in Fleet Assignment," Transportation Science, INFORMS, vol. 30(3), pages 249-260, August.
    2. Hao, Jianxiu. & Orlin, James B., 1953-., 1992. "A faster algorithm for finding the minimum cut in a graph," Working papers 3372-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Thomas A. Feo & Jonathan F. Bard, 1989. "Flight Scheduling and Maintenance Base Planning," Management Science, INFORMS, vol. 35(12), pages 1415-1432, December.
    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. 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.
    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. Safaei, Nima & Jardine, Andrew K.S., 2018. "Aircraft routing with generalized maintenance constraints," Omega, Elsevier, vol. 80(C), pages 111-122.
    4. 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.
    5. Gopalan, Ram, 2014. "The Aircraft Maintenance Base Location Problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 634-642.
    6. Cynthia Barnhart & Peter Belobaba & Amedeo R. Odoni, 2003. "Applications of Operations Research in the Air Transport Industry," Transportation Science, INFORMS, vol. 37(4), pages 368-391, November.
    7. 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.
    8. Saltzman, Robert M. & Stern, Helman I., 2022. "The multi-day aircraft maintenance routing problem," Journal of Air Transport Management, Elsevier, vol. 102(C).
    9. 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.
    10. Moudani, Walid El & Mora-Camino, Félix, 2000. "A dynamic approach for aircraft assignment and maintenance scheduling by airlines," Journal of Air Transport Management, Elsevier, vol. 6(4), pages 233-237.
    11. Başdere, Mehmet & Bilge, Ümit, 2014. "Operational aircraft maintenance routing problem with remaining time consideration," European Journal of Operational Research, Elsevier, vol. 235(1), pages 315-328.
    12. 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.
    13. Warburg, Valdemar & Gotsæd Hansen, Troels & Larsen, Allan & Norman, Hans & Andersson, Erik, 2008. "Dynamic airline scheduling: An analysis of the potentials of refleeting and retiming," Journal of Air Transport Management, Elsevier, vol. 14(4), pages 163-167.
    14. 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.
    15. L. Fleischer & É. Tardos, 1999. "Separating Maximally Violated Comb Inequalities in Planar Graphs," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 130-148, February.
    16. Egon Balas & Matteo Fischetti, 1999. "Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 273-292, May.
    17. Zhao, Xian & He, Zongda & Wu, Yaguang & Qiu, Qingan, 2022. "Joint optimization of condition-based performance control and maintenance policies for mission-critical systems," Reliability Engineering and System Safety, Elsevier, vol. 226(C).
    18. Oliver Faust & Jochen Gönsch & Robert Klein, 2017. "Demand-Oriented Integrated Scheduling for Point-to-Point Airlines," Transportation Science, INFORMS, vol. 51(1), pages 196-213, February.
    19. 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.
    20. 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.

    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:inm:ortrsc:v:32:y:1998:i:3:p:208-220. 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.