Genetically controlled random search: a global optimization method for continuous multidimensional functions
From MaRDI portal
Publication:709932
DOI10.1016/j.cpc.2005.09.007zbMath1196.90086OpenAlexW2118272947MaRDI QIDQ709932
Isaac E. Lagaris, Ioannis G. Tsoulos
Publication date: 18 October 2010
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2005.09.007
Related Items
Genanneal: genetically modified simulated annealing ⋮ Genmin: an enhanced genetic algorithm for global optimization ⋮ An improved adaptive particle swarm optimization approach for multi-modal function optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization of statistical functions with simulated annealing
- Optimization by Simulated Annealing
- A tolerant algorithm for linearly constrained optimization calculations
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Application of stochastic global optimization algorithms to practical problems
- A method of unconstrained global optimization
- Taboo Search: An Approach to the Multiple Minima Problem
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Adaptive Global Search by the Process of Competitive Evolution
- A controlled random search procedure for global optimisation
- Algorithm 829
- An Adaptive Random Search Algorithm for Constrained Minimization