An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. (October 2015)

• Record Type: Journal Article
• Authors: Sabar, Nasser R.; Kendall, Graham
• Is Part Of: Omega. Volume 56(2015:Oct.)
• Page Start: 88
• Page End: 98
• Publication Date: 2015-10
• Subjects: Aircraft landing problem -- Iterated local search -- Meta-heuristics -- Airport operation; Management -- Periodicals; 658.4005
• DOI: 10.1016/j.omega.2015.03.007
• Languages: English
• ISSNs: 0305-0483

Abstract

Abstract: Landing aircraft safely is an important operation that air traffic controllers have to deal with on a daily basis. For each arriving aircraft a runway and a landing time must be allocated. If these allocations can be done in an efficient way, it could give the airport a competitive advantage. The Aircraft Landing Problem (ALP) aims to minimize the deviation from a preferred target time of each aircraft. It is an NP-hard problem, meaning that we may have to resort to heuristic methods as exact methods may not be suitable, especially as the problem size increases. This paper proposes an iterated local search (ILS) algorithm for the ALP. ILS is a single solution based search methodology that successively invokes a local search procedure to find a local optimum solution. A perturbation operator is used to modify the current solution in order to escape from the local optimum and to provide a new solution for the local search procedure. As different problems and/or instances have different characteristics, the success of the ILS is highly dependent on the local search, the perturbation operator(s) and the perturbation strength. To address these issues, we utilize four perturbation operators and a time varying perturbation strength which changes as the algorithm progresses. A variable neighborhood descent algorithm is used as our local search. The proposed ILS generates high quality solutions for the ALP benchmark instances taken from the scientific literature, demonstrating its efficiency in terms of both solution quality and computational time. Moreover, the proposed ILS produces new best results for some instances. Highlights: In this work we propose an improved ILS for the aircraft landing problem. The proposed ILS employs multiple operators and time varying perturbation strength. The proposed ILS produces new best results for some instances.