The Adaptive Population-based Simplex method

A novel, tuning-free, population-based simplex method for continuous function optimization is proposed. The proposed method, called Adaptive Population-based Simplex (APS), uses a population from which different simplexes are selected. In addition, a local search is performed using a hyper-sphere generated around the best individual in a simplex. The approach is easy to code and easy to understand. APS is compared with four state-of-the-art approaches on five real-world problems. The experimental results show that APS generally performs better than the other methods on the test problems.

[1]  Xiaojun Wu,et al.  Random Drift Particle Swarm Optimization , 2013, ArXiv.

[2]  Margaret H. Wright,et al.  Direct search methods: Once scorned, now respectable , 1996 .

[3]  Xiaojun Wu,et al.  Solving the Power Economic Dispatch Problem With Generator Constraints by Random Drift Particle Swarm Optimization , 2014, IEEE Transactions on Industrial Informatics.

[4]  E. Sandgren,et al.  Nonlinear Integer and Discrete Programming in Mechanical Design Optimization , 1990 .

[5]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[6]  Shaoliang Zhang,et al.  Some modifications of low-dimensional simplex evolution and their convergence , 2013, Optim. Methods Softw..

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

[8]  Akbar Karimi,et al.  Global Simplex Optimization - A simple and efficient metaheuristic for continuous optimization , 2012, Eng. Appl. Artif. Intell..

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

[10]  Maurice Clerc,et al.  Guided Randomness in Optimization: Clerc/Guided Randomness in Optimization , 2015 .

[11]  Bo Yu,et al.  Low dimensional simplex evolution: a new heuristic for global optimization , 2011, Journal of Global Optimization.

[12]  P. N. Suganthan,et al.  Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms on Real World Optimization Problems , 2011 .

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

[14]  Arthur C. Sanderson,et al.  JADE: Adaptive Differential Evolution With Optional External Archive , 2009, IEEE Transactions on Evolutionary Computation.

[15]  Pierre Hansen,et al.  A restarted and modified simplex search for unconstrained optimization , 2009, Comput. Oper. Res..

[16]  Lixing Han,et al.  Implementing the Nelder-Mead simplex algorithm with adaptive parameters , 2012, Comput. Optim. Appl..

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[18]  Jeffrey C. Lagarias,et al.  Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions , 1998, SIAM J. Optim..

[19]  R. Storn,et al.  Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .