Optimizing on-demand aircraft schedules for fractional aircraft operators
Interfaces - Wagner prize papers
Simultaneous disruption recovery of a train timetable and crew roster in real time
Computers and Operations Research
An integrated aircraft routing, crew scheduling and flight retiming model
Computers and Operations Research
Computers and Operations Research
Efficient Production-Distribution System Design
Management Science
Multiple-Depot Integrated Vehicle and Crew Scheduling
Transportation Science
Computers and Operations Research
Computers and Operations Research
Airline Fleet Assignment with Enhanced Revenue Modeling
Operations Research
Integrated Airline Fleet and Crew Robust Planning
Transportation Science
An iterative approach to robust and integrated aircraft routing and crew scheduling
Computers and Operations Research
Constraint-specific recovery network for solving airline recovery problems
Computers and Operations Research
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
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
INFORMS Journal on Computing
Truck Driver Scheduling in the European Union
Transportation Science
On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem
Transportation Science
On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem
Transportation Science
Exact approaches for integrated aircraft fleeting and routing at TunisAir
Computational Optimization and Applications
Solving shortest path problems with a weight constraint and replenishment arcs
Computers and Operations Research
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation
Transportation Science
Hi-index | 0.00 |
Given a set of flight legs to be flown by a single type of aircraft, the simultaneous aircraft routing and crew scheduling problem consists of determining a minimum-cost set of aircraft routes and crew pairings such that each flight leg is covered by one aircraft and one crew, and side constraints are satisfied. While some side constraints such as maximum flight time and maintenance requirements involve only crews or aircraft, linking constraints impose minimum connection times for crews that depend on aircraft connections. To handle these linking constraints, a solution approach based on Benders decomposition is proposed. The solution process iterates between a master problem that solves the aircraft routing problem, and a subproblem that solves the crew pairing problem. Because of their particular structure, both of these problems are solved by column generation. A heuristic branch-and-bound method is used to compute integer solutions. On a set of test instances based on data provided by an airline, the integrated approach produced significant cost savings in comparison with the sequential planning process commonly used in practice. The largest instance solved contains more than 500 flight legs over a 3-day period.