An integrated flight scheduling and fleet assignment problem under uncertainty

Nabil Kenan, Aida Jebali, Ali Diabat

    Research output: Contribution to journalArticle

    Abstract

    Flight scheduling and fleet assignment are the two most prominent decisions in airline planning as they contribute toward a majority of the costs and revenues of an airline company. Moreover, these decisions have to be made 10-12 weeks prior to the flight date as mandated by labor unions in order to accommodate cabin crew scheduling requirements. Since demand and fares are highly uncertain, a two-stage stochastic programming model was developed for flight scheduling and fleet assignment where the fleet family assigned to each scheduled flight leg is decided at the first-stage. Then, the fleet type to assign to each flight leg is decided at the second-stage based on demand and fare realization. Sample average approximation (SAA) algorithm is then used to solve the problem and provide information on the quality of the solution. To the extent of our knowledge, this work is the first to apply the SAA algorithm to the airline industry. Experiments conducted on a case study based on a flight network of a legacy airline company show that modeling the stochastic problem with 100 scenarios is sufficient to capture the effect of demand and fare uncertainty and to provide a solution with an optimality gap less than 1% within a reasonable computational time. A sensitivity analysis on different parameters of the model was also carried out and points out the applicability of the proposed model and solution in practice.

    Original languageEnglish (US)
    JournalComputers and Operations Research
    DOIs
    StateAccepted/In press - Jan 1 2017

    Fingerprint

    Assignment Problem
    Sample Average Approximation
    Scheduling
    Uncertainty
    Approximation Algorithms
    Approximation algorithms
    Assignment
    Crew Scheduling
    Stochastic Programming
    Stochastic programming
    Date
    Industry
    Programming Model
    Stochastic Model
    Sensitivity Analysis
    Assign
    Optimality
    Union
    Planning
    Sufficient

    Keywords

    • Fleet assignment
    • Flight scheduling
    • Sample average approximation
    • Stochastic demand
    • Stochastic fares

    ASJC Scopus subject areas

    • Computer Science(all)
    • Modeling and Simulation
    • Management Science and Operations Research

    Cite this

    An integrated flight scheduling and fleet assignment problem under uncertainty. / Kenan, Nabil; Jebali, Aida; Diabat, Ali.

    In: Computers and Operations Research, 01.01.2017.

    Research output: Contribution to journalArticle

    @article{772e965ed1884c33a8a6682c3ed48391,
    title = "An integrated flight scheduling and fleet assignment problem under uncertainty",
    abstract = "Flight scheduling and fleet assignment are the two most prominent decisions in airline planning as they contribute toward a majority of the costs and revenues of an airline company. Moreover, these decisions have to be made 10-12 weeks prior to the flight date as mandated by labor unions in order to accommodate cabin crew scheduling requirements. Since demand and fares are highly uncertain, a two-stage stochastic programming model was developed for flight scheduling and fleet assignment where the fleet family assigned to each scheduled flight leg is decided at the first-stage. Then, the fleet type to assign to each flight leg is decided at the second-stage based on demand and fare realization. Sample average approximation (SAA) algorithm is then used to solve the problem and provide information on the quality of the solution. To the extent of our knowledge, this work is the first to apply the SAA algorithm to the airline industry. Experiments conducted on a case study based on a flight network of a legacy airline company show that modeling the stochastic problem with 100 scenarios is sufficient to capture the effect of demand and fare uncertainty and to provide a solution with an optimality gap less than 1{\%} within a reasonable computational time. A sensitivity analysis on different parameters of the model was also carried out and points out the applicability of the proposed model and solution in practice.",
    keywords = "Fleet assignment, Flight scheduling, Sample average approximation, Stochastic demand, Stochastic fares",
    author = "Nabil Kenan and Aida Jebali and Ali Diabat",
    year = "2017",
    month = "1",
    day = "1",
    doi = "10.1016/j.cor.2017.08.014",
    language = "English (US)",
    journal = "Surveys in Operations Research and Management Science",
    issn = "0305-0548",
    publisher = "Elsevier Limited",

    }

    TY - JOUR

    T1 - An integrated flight scheduling and fleet assignment problem under uncertainty

    AU - Kenan, Nabil

    AU - Jebali, Aida

    AU - Diabat, Ali

    PY - 2017/1/1

    Y1 - 2017/1/1

    N2 - Flight scheduling and fleet assignment are the two most prominent decisions in airline planning as they contribute toward a majority of the costs and revenues of an airline company. Moreover, these decisions have to be made 10-12 weeks prior to the flight date as mandated by labor unions in order to accommodate cabin crew scheduling requirements. Since demand and fares are highly uncertain, a two-stage stochastic programming model was developed for flight scheduling and fleet assignment where the fleet family assigned to each scheduled flight leg is decided at the first-stage. Then, the fleet type to assign to each flight leg is decided at the second-stage based on demand and fare realization. Sample average approximation (SAA) algorithm is then used to solve the problem and provide information on the quality of the solution. To the extent of our knowledge, this work is the first to apply the SAA algorithm to the airline industry. Experiments conducted on a case study based on a flight network of a legacy airline company show that modeling the stochastic problem with 100 scenarios is sufficient to capture the effect of demand and fare uncertainty and to provide a solution with an optimality gap less than 1% within a reasonable computational time. A sensitivity analysis on different parameters of the model was also carried out and points out the applicability of the proposed model and solution in practice.

    AB - Flight scheduling and fleet assignment are the two most prominent decisions in airline planning as they contribute toward a majority of the costs and revenues of an airline company. Moreover, these decisions have to be made 10-12 weeks prior to the flight date as mandated by labor unions in order to accommodate cabin crew scheduling requirements. Since demand and fares are highly uncertain, a two-stage stochastic programming model was developed for flight scheduling and fleet assignment where the fleet family assigned to each scheduled flight leg is decided at the first-stage. Then, the fleet type to assign to each flight leg is decided at the second-stage based on demand and fare realization. Sample average approximation (SAA) algorithm is then used to solve the problem and provide information on the quality of the solution. To the extent of our knowledge, this work is the first to apply the SAA algorithm to the airline industry. Experiments conducted on a case study based on a flight network of a legacy airline company show that modeling the stochastic problem with 100 scenarios is sufficient to capture the effect of demand and fare uncertainty and to provide a solution with an optimality gap less than 1% within a reasonable computational time. A sensitivity analysis on different parameters of the model was also carried out and points out the applicability of the proposed model and solution in practice.

    KW - Fleet assignment

    KW - Flight scheduling

    KW - Sample average approximation

    KW - Stochastic demand

    KW - Stochastic fares

    UR - http://www.scopus.com/inward/record.url?scp=85030484756&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85030484756&partnerID=8YFLogxK

    U2 - 10.1016/j.cor.2017.08.014

    DO - 10.1016/j.cor.2017.08.014

    M3 - Article

    JO - Surveys in Operations Research and Management Science

    JF - Surveys in Operations Research and Management Science

    SN - 0305-0548

    ER -