Abstract
In this paper we present state space reduction techniques for a dynamic programming algorithm applied to the Aircraft Sequencing Problem (ASP) with Constrained Position Shifting (CPS). We consider the classical version of the ASP, which calls for determining the order in which a given set of aircraft should be assigned to a runway at an airport, subject to minimum separations in time between consecutive aircraft, in order to minimize the sum of the weighted deviations from the scheduled arrival/departure times of the aircraft. The focus of the paper is on a number of ways of improving the computation times of the dynamic programming algorithm proposed. This is achieved by using heuristic upper bounds and a completion lower bound in order to reduce the state space in the dynamic programming algorithm. We compare our algorithm to an approach based on mixed integer linear programming, which was adapted from the literature for the case of CPS. We show using real-world air traffic instances from the Milan Linate Airport that the dynamic programming algorithm significantly outperforms the MILP. Furthermore, we show that the proposed algorithm is capable of solving very large instances in short computation times, and that it is suitable for use in a real-time setting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Furini, F., Persiani, C.A., Toth, P.: Aircraft sequencing problems via a rolling horizon algorithm. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 273–284. Springer, Heidelberg (2012)
Dear, R.G., Sherif, Y.S.: The dynamic scheduling of aircraft in high density terminal areas. Microelectron. Reliab. 29(5), 743–749 (1989)
Balakrishnan, H., Chandran, B.G.: Algorithms for scheduling runway operations under constrained position shifting. Oper. Res. 58(6), 1650–1665 (2010)
Beasley, J., Krishnamoorthy, M., Sharaiha, Y., Abramson, D.: Scheduling aircraft landing – the static case. Transp. Sci. 34, 180–197 (2000)
de Neufville, R., Odoni, A.R.: Airport Systems: Planning, Design and Management. McGraw-Hill, New York (2003)
Bennel, J., Mesgarpour, M., Potts, C.: Airport runway scheduling. 4OR 9, 115–138 (2011)
Abela, J., Abramson, D., Krishnamoorthy, M., De Silva, A., Mills, G.: Computing optimal schedules for landing aircraft. In: Proceeding 12th National ASOR Conference, Adelaide, Australia, pp. 71–90 (1993)
Beasley, J., Pinol, H.: Scatter search and bionomic algorithms for the aircraft landing problem. Eur. J. Oper. Res. 127(2), 439–462 (2006)
Psaraftis, H.N.: A dynamic programming approach for sequencing groups of identical jobs. Oper. Res. 28(6), 1347–1359 (1980)
Trivizas, D.A.: Optimal scheduling with maximum position shift (MPS) constraints: a runway scheduling application. J. Navig. 51(2), 250–266 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Furini, F., Kidd, M.P., Persiani, C.A., Toth, P. (2014). State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-09174-7_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09173-0
Online ISBN: 978-3-319-09174-7
eBook Packages: Computer ScienceComputer Science (R0)