Characterising constrained continuous optimisation problems

Real-world optimisation problems are usually constrained in some way. These constraints essentially modify the search space and can have a significant impact on the success of algorithms during optimisation. This paper proposes the notion of a violation landscape as a concept for analysing the nature of constrained continuous search spaces. A number of numerical measures are proposed for characterising constrained problems and these are tested on the CEC 2010 benchmark suite of constrained real-parameter optimisation problems. It is shown that for many constrained problems and algorithms, the features of the violation landscape are more relevant in terms of understanding algorithm performance than the features of the fitness landscape.

[1]  Andries Petrus Engelbrecht,et al.  A progressive random walk algorithm for sampling continuous fitness landscapes , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[2]  Carlos A. Coello Coello,et al.  What Makes a Constrained Problem Difficult to Solve by an Evolutionary Algorithm , 2004 .

[3]  Zbigniew Michalewicz,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

[4]  Michael N. Vrahatis,et al.  Unified Particle Swarm Optimization for Solving Constrained Engineering Optimization Problems , 2005, ICNC.

[5]  K. Kinnear Fitness landscapes and difficulty in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[6]  Andries Petrus Engelbrecht,et al.  A survey of techniques for characterising fitness landscapes and some possible ways forward , 2013, Inf. Sci..

[7]  Mario A. Muñoz,et al.  The Algorithm Selection Problem on the Continuous Optimization Domain , 2013 .

[8]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[9]  Garrison W. Greenwood,et al.  On the use of random walks to estimate correlation in fitness landscapes , 1998 .

[10]  P. Suganthan,et al.  Problem Definitions and Evaluation Criteria for the CEC 2010 Competition on Constrained Real- Parameter Optimization , 2010 .

[11]  Bernard Manderick,et al.  The Genetic Algorithm and the Structure of the Fitness Landscape , 1991, ICGA.

[12]  E. Weinberger,et al.  Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.

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

[14]  Garrison W. Greenwood,et al.  ARE LANDSCAPES FOR CONSTRAINED OPTIMIZATION PROBLEMS STATISTICALLY ISOTROPIC , 1998 .

[15]  Tetsuyuki Takahama,et al.  Constrained optimization by the ε constrained differential evolution with an archive and gradient-based mutation , 2010, IEEE Congress on Evolutionary Computation.

[16]  Jonathan A. Wright,et al.  Self-adaptive fitness formulation for constrained optimization , 2003, IEEE Trans. Evol. Comput..

[17]  Andries P. Engelbrecht,et al.  Fitness Landscape Analysis for Metaheuristic Performance Prediction , 2014 .

[18]  Darrell Whitley,et al.  Examining the role of local optima and schema processing in genetic search , 1999 .

[19]  N. Hansen,et al.  Markov Chain Analysis of Cumulative Step-Size Adaptation on a Linear Constrained Problem , 2015, Evolutionary Computation.

[20]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[21]  P. Stadler Fitness Landscapes , 1993 .

[22]  C. Reeves,et al.  Properties of fitness functions and search landscapes , 2001 .

[23]  Zhigang Shang,et al.  Coevolutionary Comprehensive Learning Particle Swarm Optimizer , 2010, IEEE Congress on Evolutionary Computation.

[24]  Soraya B. Rana Examining the Role of Local Optima and Schema Processing in Genetic Search , 1998 .

[25]  John R. Rice,et al.  The Algorithm Selection Problem , 1976, Adv. Comput..

[26]  Bernd Bischl,et al.  Algorithm selection based on exploratory landscape analysis and cost-sensitive learning , 2012, GECCO '12.

[27]  Kate Smith-Miles,et al.  Towards insightful algorithm selection for optimisation using meta-learning concepts , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[28]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[29]  K. Deb An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .