Generalization and completeness of stochastic local search algorithms
Authors:
- Daniel LoscosDLDaniel Loscos
- Narciso Martí-OlietNMNarciso Martí-Oliet
- Ismael RodríguezIRIsmael Rodríguez
Open Access
- 1 February 2022
- journal article
- research article
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 68
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Comunidad de Madrid (S2018/TCS-4339)
- European Commission
- Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España
This publication has 27 references indexed in Scilit:
- Metaheuristics—the metaphor exposedInternational Transactions in Operational Research, 2013
- Real-parameter evolutionary multimodal optimization — A survey of the state-of-the-artSwarm and Evolutionary Computation, 2011
- A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problemsApplied Soft Computing, 2011
- Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithmInformation Processing Letters, 2007
- Running Time Analysis of Multiobjective Evolutionary Algorithms on Pseudo-Boolean FunctionsIEEE Transactions on Evolutionary Computation, 2004
- The particle swarm optimization algorithm: convergence analysis and parameter selectionInformation Processing Letters, 2003
- On the convergence of generalized hill climbing algorithmsDiscrete Applied Mathematics, 2002
- Convergence and finite-time behavior of simulated annealingAdvances in Applied Probability, 1986
- Optimization by Simulated AnnealingScience, 1983
- Classes of recursively enumerable sets and their decision problemsTransactions of the American Mathematical Society, 1953