Airline crew scheduling with regularity

Airline crew scheduling with regularity

0.00 Avg rating0 Votes
Article ID: iaor2003579
Country: United States
Volume: 35
Issue: 4
Start Page Number: 359
End Page Number: 374
Publication Date: Nov 2001
Journal: Transportation Science
Authors: , , , ,
Keywords: vehicle routing & scheduling, personnel & manpower planning, programming: transportation, networks
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.

Reviews

Required fields are marked *. Your email address will not be published.