ISA: a hybridization between iterated local search and simulated annealing for multiple-runway aircraft landing problem
- PDF / 1,117,650 Bytes
- 21 Pages / 595.276 x 790.866 pts Page_size
- 2 Downloads / 214 Views
(0123456789().,-volV) (0123456789().,-volV)
ORIGINAL ARTICLE
ISA: a hybridization between iterated local search and simulated annealing for multiple-runway aircraft landing problem Abdelaziz I. Hammouri1
•
Malik Sh. Braik2 • Mohammed Azmi Al-Betar3 • Mohammed A. Awadallah4
Received: 24 April 2019 / Accepted: 3 December 2019 Springer-Verlag London Ltd., part of Springer Nature 2019
Abstract This paper presents an efficient method for aircraft landing problem (ALP) based on a mechanism that hybridizes the iterated local search (ILS) and simulated annealing (SA) algorithms. ALP is handled by scheduling each incoming aircraft to land on a runway in accordance with a predefined landing time frame. The main objective to address is to find a feasible aircraft scheduling solution within the range of target time. The proposed hybridization method complements the advantages of both ILS and SA in a single optimization framework, referred to as iterated simulated annealing (ISA). The optimization framework of ISA has two main loops: an inner loop and an outer loop. In the inner loop, SA is utilized through a cooling schedule and a relaxing acceptance strategy to allow ISA to escape the local optima. In the outer loop, the restart mechanism and perturbation operation of the standard ILS are used to empower ISA to broadly navigate different search space regions. Extensive evaluation experiments were conducted on thirteen small- and large-sized ALP instances to assess the effectiveness and solution quality of ISA. The obtained results confirm that the proposed ISA method considerably performs better than other state-of-the-art methods in which ISA is capable of reaching new best results in 4 out of 24 large-sized problem instances as well as obtaining the best results in all small-sized instances. Evaluation on large-sized instances confirms a high degree of performance. As a new line of research, ISA is an effective method for ALP which can be further investigated for other combinatorial optimization problems. Keywords Aircraft landing problem Iterated local search Simulated annealing Iterated simulated annealing Scheduling optimization problems
1 Introduction Air transport has definitely established itself as one of the most important means of transportation. The last two decades have experienced an immense evolution of air transport [1] for both passengers and cargo. All types of
aircraft must pass prior to landing at an approaching stage under the guidance of the air traffic control (ATC) tower, which has a responsibility for securing the flights. This is a complex daily task of the ATC towers. The presence of a limited number of runways at airports is a major obstacle for the ATC tower, particularly during the rapid increase in air traffic and rush times of landing and takeoff operations.
& Abdelaziz I. Hammouri [email protected]
2
Department of Computer Science, Al-Balqa Applied University, Al-Salt 19117, Jordan
Malik Sh. Braik [email protected]
3
Department of Information Technology, Al-Huson Universi
Data Loading...
