IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-58405-3_32.html
   My bibliography  Save this book chapter

Set-Cover Master Problem Formulations in Branch and Price Solution Methodologies for Optimal Aircrew Scheduling

In: Operations Research Proceedings 2023

Author

Listed:
  • George Kozanidis

    (University of Thessaly)

  • Odysseas Moschopoulos

    (University of Thessaly)

Abstract

We consider branch and price solution methodologies for optimal aircrew scheduling. Utilizing an optimization model termed master, these methodologies aim to assign a roster to each member of the group under consideration, so that the total system cost is minimized. The master problem is typically formulated as a set-partition optimization model. In order to expedite the identification of the attainable duty coverage, we propose its formulation as a set-cover optimization model instead, in which duty over-coverage is allowed while roster quality is ignored. The resulting set-cover solution is transformed into an equivalent set-partition one through the employment of a mixed integer optimization model which removes overcovered duties from the rosters, so as to optimize roster quality without affecting optimal coverage. We use tests on realistic problem instances for evaluating the proposed methodology.

Suggested Citation

  • George Kozanidis & Odysseas Moschopoulos, 2025. "Set-Cover Master Problem Formulations in Branch and Price Solution Methodologies for Optimal Aircrew Scheduling," Lecture Notes in Operations Research, in: Guido Voigt & Malte Fliedner & Knut Haase & Wolfgang Brüggemann & Kai Hoberg & Joern Meissner (ed.), Operations Research Proceedings 2023, chapter 0, pages 249-256, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-58405-3_32
    DOI: 10.1007/978-3-031-58405-3_32
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    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:spr:lnopch:978-3-031-58405-3_32. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.