A Review of Thresheld Convergence

A multi-modal search space can be defined as having multiple attraction basins – each basin has a single local optimum which is reached from all points in that basin when greedy local search is used. Optimization in multi-modal search spaces can then be viewed as a two-phase process. The first phase is exploration in which the most promising attraction basin is identified. The second phase is exploitation in which the best solution (i.e. the local optimum) within the previously identified attraction basin is attained. The goal of thresheld convergence is to improve the performance of search techniques during the first phase of exploration. The effectiveness of thresheld convergence has been demonstrated through applications to existing metaheuristics such as particle swarm optimization and differential evolution, and through the development of novel metaheuristics such as minimum population search and leaders and followers.

[1]  Sheng Chen,et al.  Particle swarm optimization with thresheld convergence , 2013, 2013 IEEE Congress on Evolutionary Computation.

[2]  James Kennedy,et al.  Defining a Standard for Particle Swarm Optimization , 2007, 2007 IEEE Swarm Intelligence Symposium.

[3]  Antonio Bolufé Röhler,et al.  Differential evolution with thresheld convergence , 2013, 2013 IEEE Congress on Evolutionary Computation.

[4]  James Montgomery,et al.  Identifying and exploiting the scale of a search space in differential evolution , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[5]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[6]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7]  Michael A. Lones,et al.  Metaheuristics in nature-inspired algorithms , 2014, GECCO.

[8]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[9]  Anne Auger,et al.  Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions , 2009 .

[10]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[11]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[12]  Antonio Bolufé Röhler,et al.  Extending Minimum Population Search towards large scale global optimization , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[13]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[14]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[15]  James Montgomery,et al.  Simulated annealing with thresheld convergence , 2012, 2012 IEEE Congress on Evolutionary Computation.

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  James Montgomery,et al.  A simple strategy for maintaining diversity and reducing crowding in differential evolution , 2012, 2012 IEEE Congress on Evolutionary Computation.

[18]  Antonio Bolufé Röhler,et al.  Minimum population search - Lessons from building a heuristic technique with two population members , 2013, 2013 IEEE Congress on Evolutionary Computation.

[19]  James Montgomery.  Differential evolution: Difference vectors and movement in solution space , 2009, 2009 IEEE Congress on Evolutionary Computation.