Airline Crew Scheduling with Regularity

Authors:
Diego Klabjan;Ellis L. Johnson;George L. Nemhauser;Eric Gelman;Srini Ramaswamy
Affiliations:
-;-;-;-;-
Venue:
Transportation Science
Year:
2001

Citing 0
Cited 3

Efficient trip generation with a rule modeling system for crew scheduling problems

Journal of Systems and Software
Aircrew pairings with possible repetitions of the same flight number

Computers and Operations Research
Dynamic Assignment of Crew Reserve in Airlines

International Journal of Applied Metaheuristic Computing

Quantified Score

Hi-index	0.00

Visualization

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.