Metaheuristics for Hard Optimization: Methods and Case Studies
By Johann Dréo, Patrick Siarry, A. Pétrowski, É. Taillard. 2005
483 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/2c9df50e8ebb4247517a291c8c8d7091ef879f2f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Ilhem Boussaïd
- I. Payá-Zaforteza
- Julien Lepagnot
- V. Yepes
- F. González-Vidosa
- Antonio Hospitaler
- Patrick Siarry
- Seyedali Mirjalili
Citations in the corpus
- On the Weibull cost estimation of building frames designed by simulated annealing (2010, methodology): “Heuristic methods include a large number of algorithms, such as genetic algorithms (GA henceforth), tabu search, simulated annealing (SA), ant colony optimization and neuronal networks, among others [3–6].”
- A survey on optimization metaheuristics (2013, methodology): “The TA method compares favorably with simulated annealing for combinatori al optimizati on problems , like the traveling salesman problem [76].”