A new era for Crew recovery at continental airlines
Interfaces - Special issue: Franz Edelman award for achievement in operations research and the management sciences
Operational airline reserve crew planning
Journal of Scheduling
Duty-period-based network model for crew rescheduling in European airlines
Journal of Scheduling
A Stochastic Programming Approach to the Airline Crew Scheduling Problem
Transportation Science
Robust Airline Crew Pairing: Move-up Crews
Transportation Science
Disruption management in the airline industry-Concepts, models and methods
Computers and Operations Research
Multiobjective genetic algorithm to solve the train crew scheduling problem
ISTASC'10 Proceedings of the 10th WSEAS international conference on Systems theory and scientific computation
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling
Transportation Science
Exact approaches for integrated aircraft fleeting and routing at TunisAir
Computational Optimization and Applications
On an exact method for the constrained shortest path problem
Computers and Operations Research
A hybrid meta-heuristic algorithm for optimization of crew scheduling
Applied Soft Computing
An Optimization Approach to Airline Integrated Recovery
Transportation Science
Crew pairing optimization based on hybrid approaches
Computers and Industrial Engineering
OPTIMIZING COST IN SOFTWARE DEVELOPMENT PROJECTS
Journal of Integrated Design & Process Science
Hi-index | 0.00 |
This paper describes the operational airline crew scheduling problem and represents a first published attempt to solve it. The problem consists of modifying, as necessary, personalized planned monthly assignments of airline crew members during day-to-day operations. It requires overing, at minimal cost, all flight segments from a given time period with available crew while minimizing the disturbances of crew members. To generate modified pairings for selected crew members, both the classical crew pairing problem and the problem of constructing personalized monthly assignments must be treated simultaneously. An optimization approach is proposed for the problem in which the flight schedule is fixed and represents input data. The problem is mathematically formulated as a Set Partitioning type problem, and a column generation method embedded in a branch-and-bound search tree has been implemented to solve it. Good results, from the point of view of both solution times and achieved objectives, have been obtained on generated test problems. Because the solution time is reasonable, several different scenarios of the same problem may be solved. A final decision can then be made by considering all scenarios and choosing the one whose solution is the best in the given situation.