Abstract
Aircraft sequencing problem (ASP) is to schedule the operation times of departing and arriving aircraft such that their deviation from the desired operation times are minimised. There are two types of hard constraint which make this problem very challenging: time window constraint for the operation time of each aircraft, and minimum separation time between each pair of aircraft. ASP is known to be NP-Hard. Although some progress has been made in recent years in solving ASP, existing techniques still rely on generic algorithms that usually lack problem specific knowledge. This leads to either finding low quality solutions or scrambling with large-sized problems. In this work, we propose a constraint-guided local search algorithm that advances ASP search by injecting the specific knowledge of the problem into its different phases. In the intensification phase, we propose a greedy approach that gives more priorities to aircraft that are more problematic and create more delays. In the diversification phase, we employ a bounded-diversification technique that controls the new position of each selected aircraft and does not allow them to move very far away from their current positions. Computational results show that the proposed algorithm outperforms the existing state-of-the-art methods with considerable margin.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
BITRE: Bureau of Infrastructure, Transport and Regional Economics (2017). https://bitre.gov.au/
BNE: Brisbane Airport Corporation (2017). http://www.bne.com.au/
Caprì, S., Ignaccolo, M.: Genetic algorithms for solving the aircraft-sequencing problem: the introduction of departures into the dynamic model. J. Air Transp. Manag. 10(5), 345–351 (2004)
Eurocontrol: Eurocontrol - Driving excellence in ATM performance (2017). http://www.eurocontrol.int/
Farhadi, F., Ghoniem, A., Al-Salem, M.: Runway capacity management-an empirical study with application to doha international airport. Transp. Res. Part E: Logist. Transp. Rev. 68, 53–63 (2014)
Hancerliogullari, G., Rabadi, G., Al-Salem, A.H., Kharbeche, M.: Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem. J. Air Transp. Manag. 32, 39–48 (2013)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Recent developments in deterministic sequencing and scheduling a survey. In: Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds.) Deterministic and Stochastic Scheduling. ASIC, vol. 84, pp. 35–73. Springer, Dordrecht (1982). https://doi.org/10.1007/978-94-009-7801-0_3
Mehta, V., et al.: Airport surface traffic management decision support: perspectives based on tower flight data manager prototype. Technical report (2013)
Newton, M.A.H., Pham, D.N., Sattar, A., Maher, M.: Kangaroo: an efficient constraint-based local search system using lazy propagation. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 645–659. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23786-7_49
Pinol, H., Beasley, J.E.: Scatter search and bionomic algorithms for the aircraft landing problem. Eur. J. Oper. Res. 171(2), 439–462 (2006)
Riahi, V., Khorramizadeh, M., Newton, M.H., Sattar, A.: Scatter search for mixed blocking flowshop scheduling. Expert. Syst. Appl. 79, 20–32 (2017)
Riahi, V., Newton, M.H., Su, K., Sattar, A.: Local search for flowshops with setup times and blocking constraints. In: ICAPS, pp. 199–207 (2018)
Riahi, V., Polash, M.M.A., Hakim Newton, M.A., Sattar, A.: Mixed neighbourhood local search for customer order scheduling problem. In: Geng, X., Kang, B.-H. (eds.) PRICAI 2018. LNCS (LNAI), vol. 11012, pp. 296–309. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97304-3_23
Rodríguez-Díaz, A., Adenso-Díaz, B., González-Torre, P.L.: Minimizing deviation from scheduled times in a single mixed-operation runway. Comput. Oper. Res. 78, 193–202 (2017)
Sabar, N.R., Kendall, G.: An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega 56, 88–98 (2015)
Salehipour, A., Modarres, M., Naeni, L.M.: An efficient hybrid meta-heuristic for aircraft landing problem. Comput. Oper. Res. 40(1), 207–213 (2013)
Sherali, H., Ghoniem, A., Baik, H., Trani, A.: A combined arrival-departure aircraft sequencing problem. Manuscript, Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University 250 (2010)
Soykan, B., Rabadi, G.: A tabu search algorithm for the multiple runway aircraft scheduling problem. In: Rabadi, G. (ed.) Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. ISOR, vol. 236, pp. 165–186. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-26024-2_9
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Riahi, V., Newton, M.A.H., Sattar, A. (2018). Constraint-Guided Local Search for Single Mixed-Operation Runway. In: Mitrovic, T., Xue, B., Li, X. (eds) AI 2018: Advances in Artificial Intelligence. AI 2018. Lecture Notes in Computer Science(), vol 11320. Springer, Cham. https://doi.org/10.1007/978-3-030-03991-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-030-03991-2_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03990-5
Online ISBN: 978-3-030-03991-2
eBook Packages: Computer ScienceComputer Science (R0)