2019
DOI: 10.1007/s00521-019-04659-y
|View full text |Cite
|
Sign up to set email alerts
|

ISA: a hybridization between iterated local search and simulated annealing for multiple-runway aircraft landing problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(13 citation statements)
references
References 40 publications
0
9
0
Order By: Relevance
“…If the CPS restrictions are not considered in the RSP however, then exact methods do not solve large instances in reasonable computation times. The scatter search of [79], the hybrid metaheuristic VND+SA of [51], the hybrid iterated local search / simulated annealing of [58], and the hybrid iterated local search / VND of [69] appear to be good candidate approaches to solve the RSP with one or multiple runways, and with the more general objective of minimizing deviations from target times. They provide good-quality solutions in terms of the gap to the best-known solutions, within reasonable computation times on the OR-library test problems.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…If the CPS restrictions are not considered in the RSP however, then exact methods do not solve large instances in reasonable computation times. The scatter search of [79], the hybrid metaheuristic VND+SA of [51], the hybrid iterated local search / simulated annealing of [58], and the hybrid iterated local search / VND of [69] appear to be good candidate approaches to solve the RSP with one or multiple runways, and with the more general objective of minimizing deviations from target times. They provide good-quality solutions in terms of the gap to the best-known solutions, within reasonable computation times on the OR-library test problems.…”
Section: Discussionmentioning
confidence: 99%
“…In the literature prior to 2010, Genetic Algorithms (GA) were the mostlyused metaheuristic [52,53,54,55,56]). Recently, Tabu Search (TS) and Simulated Annealing (SA) gained much more attention, and became the mostused metaheuristics [10,19,42,51,57,58,59]. Other metaheuristics are also used in the literature, such as Ant Colony Optimization (ACO) [60,61,62], and Variable Neighborhood Descent (VND) [51,63].…”
Section: Stochastic Solution Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…These methods are very effective in generating new legal circuit configurations. Due to large perturbations in the early stages of SA manages the local search procedure [36], the use of matrix group encoding method can generate large perturbations to explore new areas of the search space. By choosing the solution with the highest fitness among the newly generated solutions (i.e., X 1 , X 2 , X 3 ) as the new solution X , the search efficiency can be further improved.…”
Section: ) Inner Loopmentioning
confidence: 99%
“…In land use optimization, there are many mature nonlinear optimization algorithms, such as the simulated annealing algorithm (Hammouri, Braik, Al‐Betar, & Awadallah, 2020), the genetic algorithm (Tian, Li, Han, Liu, & Mo, 2020), and the particle swarm optimization algorithm (Mirghaed, Mohammadzadeh, Salmanmahiny, & Mirkarimi, 2020). However, these models require configuring the land use type for each grid unit in sequence during optimization and performing many iterations, which is not conducive to achieving a significant reduction in optimization time.…”
Section: Introductionmentioning
confidence: 99%