Aircraft Sequencing Problems via a Rolling Horizon AlgorithmCombinatorial Optimization

Abstract

ft sequencing on the runway is a challenging optimization problem that aims to reduce the delays and the air traffic controllers workload in a scenario characterized by a continuous growth of the air transportation demand. In this paper we consider the problem of sequencing both arrivals and departures on a single runway airport. We formalize the problem using a Mixed Integer Programming Model and we propose a rolling horizon solution approach. Computational results on real-world air traffic instances from the Milano Linate Airport are reported. The results show that the proposed approach is able to significantly improve on the First Come First Served (FCFS) sequence.

Original document

The different versions of the original document can be found in:

• http://hdl.handle.net/11585/402965

• http://www.springerlink.com/index/pdf/10.1007/978-3-642-32147-4_25,

http://dx.doi.org/10.1007/978-3-642-32147-4_25

• https://link.springer.com/chapter/10.1007%2F978-3-642-32147-4_25,

https://dblp.uni-trier.de/db/conf/iscopt/isco2012.html#FuriniPT12,

https://dl.acm.org/citation.cfm?id=2368913,

http://doi.org/10.1007/978-3-642-32147-4_25,

https://doi.org/10.1007/978-3-642-32147-4_25,

https://rd.springer.com/chapter/10.1007/978-3-642-32147-4_25,

https://academic.microsoft.com/#/detail/39795348