Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions
From MaRDI portal
Publication:967212
DOI10.1007/s10589-008-9176-7zbMath1190.90141OpenAlexW1980325286MaRDI QIDQ967212
Akbar Karimi, Hadi Nobahari, Patrick Siarry
Publication date: 28 April 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9176-7
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The continuous differential ant-stigmergy algorithm for numerical optimization ⋮ Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms ⋮ An ellipsoidal distance-based search strategy of ants for nonlinear single and multiple response optimization problems ⋮ Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems ⋮ Hybrid real-code ant colony optimisation for constrained mechanical design ⋮ Memory and Learning in Metaheuristics
Cites Work
- Unnamed Item
- Unnamed Item
- Ant colony optimization for continuous domains
- Tabu search applied to global optimization
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
- Taboo Search: An Approach to the Multiple Minima Problem
- Tabu Search—Part I
- Tabu Search—Part II
- FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
- Ants can colour graphs
- Enhanced simulated annealing for globally minimizing functions of many-continuous variables
- Stochastic Algorithms: Foundations and Applications
- A continuous genetic algorithm designed for the global optimization of multimodal functions