An improved central force optimization algorithm for multimodal optimization
From MaRDI portal
Publication:2336815
DOI10.1155/2014/895629zbMath1442.90182OpenAlexW2044686528WikidataQ59054174 ScholiaQ59054174MaRDI QIDQ2336815
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/895629
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Optimization by Simulated Annealing
- An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- A hybrid simplex search and particle swarm optimization for unconstrained optimization
- Central force optimization: A new deterministic gradient-like optimization metaheuristic
- Convergence analysis and performance of an extended central force optimization algorithm
- GSA: A gravitational search algorithm
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- A Simplex Method for Function Minimization
This page was built for publication: An improved central force optimization algorithm for multimodal optimization