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.
|Publication status||Published - 2010|
|Event||4th Nordic Optimization Symposium - Aarhus, Denmark|
Duration: 30 Sep 2010 → 2 Oct 2010
Conference number: 4
|Conference||4th Nordic Optimization Symposium|
|Period||30/09/2010 → 02/10/2010|