A branch and cut heuristic for a runway scheduling problem

详细

The paper is focused on one of the major air traffic management problem that consists in sequencing and scheduling airplanes landing and taking off on a runway. This difficult practical task is still carried out by flight controllers manually with little help from decision support systems. In this paper we propose an approach based on a time indexed integer programming formulation. The formulation is solved with a branch and cut method combined with some heuristic rules for dimension reduction. The effectiveness of the proposed approach is illustrated by computational experiments on real-life problem instances for the Milano Linate airport.