Workforce planning in a lotsizing mail processing problem
Computers and Operations Research
Duty-period-based network model for crew rescheduling in European airlines
Journal of Scheduling
Accelerating column generation for aircraft scheduling using constraint propagation
Computers and Operations Research
Computers and Operations Research
Integrated Routing and Scheduling of Hazmat Trucks with Stops En Route
Transportation Science
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
A Multicommodity Flow Approach to the Crew Rostering Problem
Operations Research
Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
Operations Research
Selected Topics in Column Generation
Operations Research
Bi-dynamic constraint aggregation and subproblem reduction
Computers and Operations Research
The train driver recovery problem-A set partitioning based model and solution method
Computers and Operations Research
General hybrid column generation algorithm for crew scheduling problems using genetic algorithm
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
INFORMS Journal on Computing
Color-Coding Algorithms to the Balanced Path Problem: Computational Issues
INFORMS Journal on Computing
Handling rest requirements and preassigned activities in airline crew pairing optimization
INOC'11 Proceedings of the 5th international conference on Network optimization
Analysis of three mathematical models of the Staff Rostering Problem
Journal of Scheduling
A Column-Generation Based Tactical Planning Method for Inventory Routing
Operations Research
On an exact method for the constrained shortest path problem
Computers and Operations Research
Hi-index | 0.00 |
This article describes a method for solving the crew rostering problem in air transportation. This problem consists of constructing personalized schedules that assign pairings, days off, and other activities to airline crew members. A generalized set partitioning model and a method using column generation have been used. This method has been adapted in a number of ways to take advantage of the nature of the problem and to accelerate solution. Numerical tests on problems from Air France have demonstrated that this method is capable of solving very large scale problems with thousands of constraints and hundreds of subproblems. The tests have also shown that these adaptations are capable of reducing solution time by a factor of about a thousand. Finally, results from this method are compared with those obtained with the method currently used at Air France.