|
Avtomatika i Telemekhanika, 2016, Issue 11, Pages 131–141
(Mi at14601)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Topical issue
A branch and cut heuristic for a runway scheduling problem
I. L. Vasilyeva, P. Avellab, M. Bocciab a Matrosov Institute for System Dynamics and Control Theory,
Siberian Branch of the Russian Academy of Sciences, Irkutsk, Russia
b University of Sannio, Benevento, Italy
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.
Citation:
I. L. Vasilyev, P. Avella, M. Boccia, “A branch and cut heuristic for a runway scheduling problem”, Avtomat. i Telemekh., 2016, no. 11, 131–141; Autom. Remote Control, 77:11 (2016), 1985–1993
Linking options:
https://www.mathnet.ru/eng/at14601 https://www.mathnet.ru/eng/at/y2016/i11/p131
|
Statistics & downloads: |
Abstract page: | 211 | Full-text PDF : | 88 | References: | 31 | First page: | 15 |
|