Journal Article10.1016/J.ESWA.2013.08.018
An adaptive single-point algorithm for global numerical optimization
TL;DR: Test results confirm that SAC is competitive against state-of-the-art approaches such as micro-Particle Swarm Optimization, CMA-ES or Simple Adaptive Differential Evolution.
read more
Abstract: This paper describes a novel algorithm for numerical optimization, called Simple Adaptive Climbing (SAC). SAC is a simple efficient single-point approach that does not require a careful fine-tunning of its two parameters. SAC algorithm shares many similarities with local optimization heuristics, such as random walk, gradient descent, and hill-climbing. SAC has a restarting mechanism, and a powerful adaptive mutation process that resembles the one used in Differential Evolution. The algorithms SAC is capable of performing global unconstrained optimization efficiently in high dimensional test functions. This paper shows results on 15 well-known unconstrained problems. Test results confirm that SAC is competitive against state-of-the-art approaches such as micro-Particle Swarm Optimization, CMA-ES or Simple Adaptive Differential Evolution.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Metaheuristic research: a comprehensive survey
TL;DR: A survey of metaheuristic research in literature consisting of 1222 publications from year 1983 to 2016 is performed to highlight potential open questions and critical issues raised in literature and provides guidance for future research to be conducted more meaningfully.
747
Globally-biased BIRECT algorithm with local accelerators for expensive global optimization
TL;DR: The numerical results show that the new approach effectively addresses well-known DIRECT weaknesses, has beneficial effects on the overall performance, and on average, gives significantly better results compared to several DIRECT -type methods widely used in decision-making expert systems.
67
Negative selection algorithm with constant detectors for anomaly detection
Dong Li,Shulin Liu,Hongli Zhang +2 more
- 01 Nov 2015
TL;DR: FB-NSA and FFB- NSA outperforms the other anomaly detection methods in most cases and the abnormal degree based on the CFB-NSA can be used to diagnose the different fault types with the same fault degree, and the same Fault type with the different Fault degree.
42
Controller Tuning by Metaheuristics Optimization
Maude Josée Blondin
- 01 Jan 2021
TL;DR: In this paper, the authors present a brief history of metaheuristics and their origin, a comprehensive list of published metaheuristic methods and their first application as well as a general skeleton/framework.
4
References
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces
Rainer Storn,Kenneth Price +1 more
TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization
TL;DR: This paper proposes a self- Adaptive DE (SaDE) algorithm, in which both trial vector generation strategies and their associated control parameter values are gradually self-adapted by learning from their previous experiences in generating promising solutions.
3.6K
Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization
Ponnuthurai Nagaratnam Suganthan,Nikolaus Hansen,Jing Liang,Kalyanmoy Deb,Y. P. Chen,Anne Auger,Santosh Tiwari +6 more
- 01 Jan 2005
TL;DR: This special session is devoted to the approaches, algorithms and techniques for solving real parameter single objective optimization without making use of the exact equations of the test functions.
A restart CMA evolution strategy with increasing population size
Anne Auger,Nikolaus Hansen +1 more
- 12 Dec 2005
TL;DR: The IPOP-CMA-ES is evaluated on the test suit of 25 functions designed for the special session on real-parameter optimization of CEC 2005, where the population size is increased for each restart (IPOP).
1K
Solving Multiobjective Optimization Problems Using an Artificial Immune System
TL;DR: An algorithm based on the clonal selection principle to solve multiobjective optimization problems (either constrained or unconstrained) using Pareto dominance and feasibility to identify solutions that deserve to be cloned and uses two types of mutation.