Mobility Compass

• Pohl, Maximilian
• Kolisch, Rainer
• Artigues, Christian

Abstract

International audience ; We address the runway scheduling problem under consideration of winter operations. During snowfall, runways have to be temporarily closed in order to clear them from snow, ice and slush. We propose an integrated optimization model to simultaneously plan snow removal for multiple runways and to assign runways and takeoff and landing times to aircraft. For this winter runway scheduling problem, we present a time-discrete binary model formulation using clique inequalities and an equivalent constraint programming model. To solve the winter runway scheduling problem optimally, we propose an exact solution methodology. Our start heuristic based on constraint programming generates a feasible initial start solution. We use a column generation scheme, which we initialize with a heuristic solution, to identify all variables of the binary program which are required to solve it optimally. Finally, we apply a branch-and-bound procedure to our resulting binary program. Additionally, we present an enhanced time discretization method to balance model size and solution quality. We apply our algorithm to realistic instances from a large international airport. An analysis of resulting model sizes proves the ability of our approach to significantly reduce the number of required variables and constraints of the time-discrete binary program. We also show that our method computes optimal schedules in a short amount of time and often outperforms a time-continuous formulation as well as a pure constraint programming approach.

Topics

• aircraft
• operations research
• computer science
• algorithm
• variable
• landing
• takeoff
• optimisation
• scheduling
• constraint
• bottleneck
• ice
• airport runway
• timetable
• snow
• international airport
• winter
• airport operation
• snow removal
• snowfall

Search in FID move catalog