IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v43y1997i6p841-855.html
   My bibliography  Save this article

Daily Aircraft Routing and Scheduling

Author

Listed:
  • Guy Desaulniers

    (GERAD and École Polytechnique de Montréal, Montréal, Québec, Canada H3C 3A7)

  • Jacques Desrosiers

    (GERAD and École des Hautes Études Commerciales, Montréal, Québec, Canada H3T 2A7)

  • Yvan Dumas

    (Ad Opt Technologies, Montréal, Québec, Canada H3V 1G4)

  • Marius M. Solomon

    (Northeastern University and GERAD, Boston, Massachusetts 02115)

  • François Soumis

    (GERAD and École Polytechnique de Montréal, Montréal, Québec, Canada H3C 3A7)

Abstract

In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily schedules which maximize the anticipated profits derived from the aircraft of a heterogeneous fleet. This fleet must cover a set of operational flight legs with known departure time windows, durations and profits according to the aircraft type. We present two models for this problem: a Set Partitioning type formulation and a time constrained multicommodity network flow formulation. We describe the network structure of the subproblem when a column generation technique is applied to solve the linear relaxation of the first model and when a Dantzig-Wolfe decomposition approach is used to solve the linear relaxation of the second model. The linear relaxation of the first model provides upper bounds. Integer solutions to the overall problem are derived through branch-and-bound. By exploiting the equivalence between the two formulations, we propose various optimal branching strategies compatible with the column generation technique. Finally we report computational results obtained on data provided by two different airlines. These results show that significant profit improvement can be generated by solving the DARSP using our approach and that this can be obtained in a reasonable amount of CPU time.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ormnsc:v:43:y:1997:i:6:p:841-855
    DOI: 10.1287/mnsc.43.6.841
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.43.6.841
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.43.6.841?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
    ---><---

    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:ormnsc:v:43:y:1997:i:6:p:841-855. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.