Fleet Scheduling Optimization: A Simulated Annealing Approach
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Accelerating column generation for aircraft scheduling using constraint propagation
Computers and Operations Research
An integrated aircraft routing, crew scheduling and flight retiming model
Computers and Operations Research
Computers and Operations Research
Maintenance Routing for Train Units: The Transition Model
Transportation Science
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
Solving the flight frequency programming problem with particle swarm optimization
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
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
Modifying lines-of-flight in the planning process for improved maintenance robustness
Computers and Operations Research
A hybrid column generation and constraint programming optimizer for the tail assignment problem
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
Federal aviation regulations require that all aircraft undergo maintenance after flying a certain number of hours. To ensure high aircraft utilization, maintenance is done at night, and these regulations translate into requiring aircraft to overnight at a maintenance station every three to four days (depending on the fleet type), and to visit a balance-check station periodically. After the schedule is fleeted, the aircraft are routed to satisfy these maintenance requirements. We give fast and simple polynomial-time algorithms for finding a routing of aircraft in a graph whose routings during the day are fixed, that satisfies both the three-day maintenance as well as the balance-check visit requirements under two different models: a static infinite-horizon model and a dynamic finite-horizon model. We discuss an implementation where we embed the static infinite-horizon model into a three-stage procedure for finding a maintenance routing of aircraft.