Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
From MaRDI portal
Publication:1037659
DOI10.1016/j.ejor.2009.03.035zbMath1175.90433OpenAlexW2101595632MaRDI QIDQ1037659
Peng-Yeng Yin, Jia-Xian Zhu, Fred Glover, Manuel Laguna
Publication date: 16 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.035
Related Items
Low complexity metaheuristics for joint ML estimation problems, Eidetic wolf search algorithm with a global memory structure, Cellular particle swarm optimization, Self-adaptive learning based particle swarm optimization, A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior, Directed particle swarm optimization with Gaussian-process-based function forecasting, A power-deficiency and risk-management model for wind farm micro-siting using cyber swarm algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hybrid scatter tabu search for unconstrained global optimization
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Variable neighborhood search
- An experimental evaluation of a scatter search for the linear ordering problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Finding local optima of high-dimensional functions using direct search methods
- Adaptive memory programming for constrained global optimization
- A particle swarm pattern search method for bound constrained global optimization
- Global optimization by continuous grasp
- Tabu search directed by direct search methods for nonlinear global optimization
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
