Flight scheduling and maintenance base planning
Management Science
Daily aircraft routing and scheduling
Management Science
The Four-Day Aircraft Maintenance Routing Problem
Transportation Science
The Aircraft Maintenance Routing Problem
Operations Research
Flight String Models for Aircraft Fleeting and Routing
Transportation Science
Airline Fleet Assignment with Time Windows
Transportation Science
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
Transportation Science
Airline Crew Scheduling with Time Windows and Plane-Count Constraints
Transportation Science
Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions
Operations Research
Computers and Operations Research
Computers and Operations Research
A multi-objective approach for robust airline scheduling
Computers and Operations Research
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
INFORMS Journal on Computing
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
Practical enhancements to the Magnanti-Wong method
Operations Research Letters
Integrated staffing and scheduling for an aircraft line maintenance problem
Computers and Operations Research
Solving a reverse supply chain design problem by improved Benders decomposition schemes
Computers and Industrial Engineering
An integrated scenario-based approach for robust aircraft routing, crew pairing and re-timing
Computers and Operations Research
Hi-index | 0.01 |
In the integrated aircraft routing, crew scheduling and flight retiming problem, a minimum-cost set of aircraft routes and crew pairings must be constructed while choosing a departure time for each flight leg within a given time window. Linking constraints ensure that the same schedule is chosen for both the aircraft routes and the crew pairings, and impose minimum connection times for crews that depend on aircraft connections and departure times. We propose a compact formulation of the problem and a Benders decomposition method with a dynamic constraint generation procedure to solve it. Computational experiments performed on test instances provided by two major airlines show that allowing some flexibility on the departure times within an integrated model yields significant cost savings while ensuring the feasibility of the resulting aircraft routes and crew pairings.