Solving the Airline Crew Pairing Problem using Subsequence Generation

Matias Sevel Rasmussen, David Ryan, Richard Martin Lusby, Jesper Larsen

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    Abstract

    Good and fast solutions to the airline crew pairing problem are highly interesting for the airline industry, as crew costs are the biggest expenditure after fuel for an airline. The crew pairing problem is typically modelled as a set partitioning problem and solved by column generation. However, the extremely large number of possible columns naturally has an impact on the solution time. In this work in progress we severely limit the number of allowed subsequent flights, i.e. the subsequences, thereby significantly decreasing the number of possible columns. Set partitioning problems with limited subsequence counts are known to be easier to solve, resulting in a decrease in solution time. The problem though, is that a small number of deep subsequences might be needed for an optimal or near-optimal solution and these might not have been included by the subsequence limitation. Therefore, we try to identify or generate such subsequences that potentially can improve the solution value.
    Original languageEnglish
    Title of host publicationProceedings of the 44th Annual conference of the Operational Research Society of New Zealand
    Publication date2009
    Pages169-171
    Publication statusPublished - 2009
    Event44th Annual Conference of the Operational Research Society of New Zealand - Christchurch, New Zealand
    Duration: 1 Jan 2009 → …

    Conference

    Conference44th Annual Conference of the Operational Research Society of New Zealand
    CityChristchurch, New Zealand
    Period01/01/2009 → …

    Fingerprint Dive into the research topics of 'Solving the Airline Crew Pairing Problem using Subsequence Generation'. Together they form a unique fingerprint.

    Cite this