Abstract
The airline crew scheduling problem is the problem of assigning crew itineraries to flights. The problem is hard due to a large number of itineraries and the complicated cost function of an itinerary. The classic approach, which uses a set partitioning formulation, only captures the objective function of minimizing cost. We add a second goal of maximizing the repetition or regularity of itineraries over a weekly horizon and we develop models that capture regularity. We present a new algorithm that solves the crew scheduling problem over a weekly horizon. Solutions are reported that improve on existing solutions used by an airline.
Original language | English (US) |
---|---|
Pages (from-to) | 359-374 |
Number of pages | 16 |
Journal | Transportation Science |
Volume | 35 |
Issue number | 4 |
DOIs | |
State | Published - Nov 2001 |
ASJC Scopus subject areas
- Transportation
- Civil and Structural Engineering