Back to Search
Start Over
A branch and cut heuristic for a runway scheduling problem.
- Source :
-
Automation & Remote Control . Nov2016, Vol. 77 Issue 11, p1985-1993. 9p. - Publication Year :
- 2016
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00051179
- Volume :
- 77
- Issue :
- 11
- Database :
- Academic Search Index
- Journal :
- Automation & Remote Control
- Publication Type :
- Academic Journal
- Accession number :
- 119435505
- Full Text :
- https://doi.org/10.1134/S0005117916110084