Journal of Computer and System Sciences
How not to lie with statistics: the correct way to summarize benchmark results
Communications of the ACM - The MIT Press scientific computation series
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Studying overheads in massively parallel MIN/MAX-tree evaluation
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
The fleet assignment problem: solving a large-scale integer program
Mathematical Programming: Series A and B
Daily aircraft routing and scheduling
Management Science
Air transportation simulation: SimAir: a stochastic model of airline operations
Proceedings of the 32nd conference on Winter simulation
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
The reason for the benefits of minimax search
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Pathology on game trees revisited, and an alternative to minimaxing
Artificial Intelligence
The *-minimax search procedure for trees containing chance nodes
Artificial Intelligence
Polyhedral and algorithmic properties of quantified linear programs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Hi-index | 0.00 |
Given a flight schedule, which is a set of non-stop flights, called legs, with specified departure and arrival times, and a set of aircraft types, called subfleets, the fleet assignment problem is to determine which aircraft type should fly each leg. The objective is to maximize the overall profit. Usually, planners assume that precise input data are determininstically available at planning time. As a consequence, an important insufficiency of modern industrial plans, especially flight-plans, is their lack of robustness. Disruptions prevent from operating as planned before and induce high costs for trouble shooting. One reason for the uncertainties in the data for fleet assignment is that this problem is part of a long row of optimization problems of an airline. Therefore, important restrictions of later steps like connection dependent ground times should be considered in the fleet assignment problem. We show how connection dependent ground times can be added to the fleet assignment problem and presents three optimization methods, varying in run time and solution quality, that can solve real-world problem instances with more than 6000 legs within minutes. Moreover, real or believed non-determinism leads to inevitable uncertainties in input data. As a consequence, instead of a traditional plan, a flexible strategy which reacts on different relizations of the uncertain data is demanded. The Repair Game is a formalization of a planning task, and playing it performs disruption management and generates robust plans with the help of game tree search. We introduce the game and present experimental results of a feasibility study.