Michael A. Lones
ABSTRACT
To many people, the terms nature-inspired algorithm and metaheuristic are interchangeable. However, this contemporary usage is not consistent with the original meaning of the term metaheuristic, which referred to something closer to a design pattern than to an algorithm. In this paper, it is argued that the loss of focus on true metaheuristics is a primary reason behind the explosion of "novel" nature-inspired algorithms and the issues this has raised. To address this, this paper attempts to explicitly identify the metaheuristics that are used in conventional optimisation algorithms, discuss whether more recent nature-inspired algorithms have delivered any fundamental new knowledge to the field of metaheuristics, and suggest some guidelines for future research in this field.
- M. Gendreau and J. Y. Potvin. Handbook of Metaheuristics. Springer, 2nd edition, 2010. Google Scholar
Cross Ref
- K. M. Passino. Biomimicry of bacterial foraging for distributed optimization and control. Control Systems, IEEE, 22(3):52--67, June 2002.Google ScholarCross Ref
- L. Rios and N. Sahinidis. Derivative-free optimization. Journal of Global Optimization, 56(3):1247--1293, 2013.Google ScholarCross Ref
- G. Rozenberg, T. Bäck, and J. N. Kok. Handbook of Natural Computing. Springer, Berlin, Heidelberg, 2012. Google ScholarCross Ref
- K. Sörensen. Metaheuristics - the metaphor exposed. Intl. Trans. in Op. Res., Feb. 2013. online version.Google Scholar
- X. S. Yang. Nature-Inspired Metaheuristic Algorithms. Luniver Press, 2nd edition, 2010. Google ScholarCross Ref
Index Terms
- Metaheuristics in nature-inspired algorithms
Recommendations
A stochastic nature inspired metaheuristic for clustering analysis
This paper presents a new stochastic nature inspired methodology, which is based on the concepts of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), for optimally clustering N objects into K clusters. Due to the nature of stochastic ...
Bee-inspired metaheuristics for global optimization: a performance comparison
AbstractMetaheuristics are widely applied to solve optimization problems. Numerous metaheuristic algorithms inspired by natural processes have been introduced in the past years. Studying and comparing the convergence of metaheuristics is helpful in future ...
Metaheuristics for large-scale instances of the linear ordering problem
ILS and GDA metaheuristics for the linear ordering problem are introduced.They are able to tackle large instances in line with real applications.Introduced methods are the first of their kind ever applied to large-sized instances.All best known ...
Comments