ABSTRACT
Numerous constraint handling techniques were proposed in the past to be used with evolutionary algorithms (EA). According to the no free lunch theorem, there is no single algorithm that can consistently outperform over all other algorithms for all types of problems and conditions. Depending on factors like feasibility ratio, multi-modality and problem specific characteristics, the exploration power of the chosen EA, different constraint handling techniques can be effective on different problems. The performance of Covariance Matrix adaptation Evolutionary Strategy (CMA-ES) has been studied for unconstrained optimization problems. But, there has not been much research work done for the constrained counterpart. Motivated by this observation, we studied the performance of CMA-ES with three different constraint handling techniques (CHT) present in the literature. We conducted experiment to test the algorithm's performance with each technique separately on CEC-2010 benchmark problem sets. The relative performance of the algorithm with respect to the constraint handling techniques and comparison with state-of-the-art algorithm is presented in this paper.
- Storn, R. and Price, K. Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization, 11, 4 1997), 341--359. Google ScholarDigital Library
- Erskine, A., Joyce, T. and Herrmann, J. M. Stochastic stability of particle swarm optimisation. Swarm Intelligence(November 09 2017).Google Scholar
- Mezura-Montes, E. and Coello, C. A. C. A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Transactions on Evolutionary Computation, 9, 1 2005), 1--17. Google ScholarDigital Library
- Kim, J.-H. and Myung, H. Evolutionary programming techniques for constrained optimization problems. Evolutionary Computation, IEEE Transactions on, 1, 2 1997), 129--140. Google ScholarDigital Library
- Goldberg, D. E. and Holland, J. H. Genetic Algorithms and Machine Learning. Machine Learning, 3, 2 (October 01 1988), 95--99. Google ScholarDigital Library
- {6} Hansen, N. The CMA Evolution Strategy: A Tutorial. City, 2005.Google Scholar
- Wolpert, D. H. and Macready, W. G. No free lunch theorems for optimization. Trans. Evol. Comp, 1, 1 1997), 67--82. Google ScholarDigital Library
- Arnold, D. V. a. H.-G. B. Investigation of the (μ, λ)-ES in the presence of noise City, 2001.Google Scholar
- Arnold, D. V. and Hansen, N. A (1+ 1)-CMA-ES for constrained optimisation. ACM, City, 2012.Google ScholarDigital Library
- Chocat, R., Brevault, L., Balesdent, M. and Defoort, S. Modified Covariance Matrix Adaptation-Evolution Strategy algorithm for constrained optimization under uncertainty, application to rocket design. International Journal for Simulation and Multidisciplinary Design Optimization, 62015), A1.Google Scholar
- Abdolmaleki, A., Price, B., Lau, N., Reis, L. P. and Neumann, G. Deriving and improving CMA-ES with Information geometric trust regions2017).Google Scholar
- Jastrebski, G. A., Dalhousie, U. and Faculty of Computer, S. Improving evolution strategies through active covariance matrix adaptation. Halifax, N.S., 2005.Google Scholar
- Gorman, P. J., Gregory, M. D. and Werner, D. H. Design of Ultra-Wideband, Aperiodic Antenna Arrays with the CMA Evolutionary Strategy. IEEE Transactions on Antennas and Propagation, 62, 4 2014), 1663--1672.Google Scholar
- de Paula Garcia, R., de Lima, B. S. L. P., de Castro Lemonge, A. C. and Jacob, B. P. A rank-based constraint handling technique for engineering design optimization problems solved by genetic algorithms. Computers & Structures, 1872017), 77--87. Google ScholarDigital Library
- Gregory, M. D., Bayraktar, Z. and Werner, D. H. Fast Optimization of Electromagnetic Design Problems Using the Covariance Matrix Adaptation Evolutionary Strategy. IEEE Transactions on Antennas and Propagation, 59, 4 2011), 1275--1285.Google ScholarCross Ref
- Kusakci, A. O. and Can, M. A novel evolution strategy for constrained optimization in engineering design. City, 2013.Google Scholar
- Kusakci, A. O. and Can, M. An adaptive penalty based covariance matrix adaptation-evolution strategy. Computers & Operations Research, 40, 10 (2013/10/01/ 2013), 2398--2417.Google ScholarCross Ref
- Hamida, S. B. and Schoenauer, M. ASCHEA: new results using adaptive segregational constraint handling. City, 2002.Google Scholar
- Takahama, T. a. S. S. Fast and stable constrained optimization by the ε constrained differential evolution. Pacific Journal of optimization2009), 261--282.Google Scholar
- Das, S. and Suganthan, P. Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur Univ., Nanyang Technol. Univ., Kolkata, India2010).Google Scholar
- Takahama, T. and Sakai, S. Efficient Constrained Optimization by the ε Constrained Rank-Based Differential Evolution. City, 2012.Google Scholar
- Takahama, T. and Sakai, S. Solving Constrained Optimization Problems by the s Constrained Particle Swarm Optimizer with Adaptive Velocity Limit Control. City, 2006.Google Scholar
- Takahama, T. and Sakai, S. Constrained Optimization by the ε Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites. City, 2006.Google Scholar
- Mallipeddi, R. and Suganthan, P. N. Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems. City, 2010.Google Scholar
- Deb, K. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186, 2 (2000/06/09/ 2000), 311--338.Google ScholarCross Ref
- Costa, M. F. P., Francisco, R. B., Rocha, A. M. A. C. and Fernandes, E. M. G. P. Theoretical and Practical Convergence of a Self-Adaptive Penalty Algorithm for Constrained Global Optimization. Journal of Optimization Theory and Applications, 174, 3 (September 01 2017), 875--893. Google ScholarDigital Library
- Farmani, R. and Wright, J. A. Self-adaptive fitness formulation for constrained optimization. IEEE Transactions on Evolutionary Computation, 7, 5 2003), 445--455. Google ScholarDigital Library
- Tessema, B. and Yen, G. G. A Self Adaptive Penalty Function Based Algorithm for Constrained Optimization. City, 2006.Google Scholar
- Takahama, T. a. S. S. Constrained optimization by the ε constrained differential evolution with an archive and gradient-based mutation. Evolutionary Computation (CEC), 2010 IEEE Congress on2010).Google Scholar
Index Terms
- Solving constrained optimization problems by using covariance matrix adaptation evolutionary strategy with constraint handling methods
Recommendations
Solving dynamic constraint optimization problems using ICHEA
ICONIP'12: Proceedings of the 19th international conference on Neural Information Processing - Volume Part IIIMany real-world constrained problems have a set of predefined static constraints that can be solved by evolutionary algorithms (EAs) whereas some problems have dynamic constraints that may change over time or may be received by the problem solver at run ...
Evolutionary constrained optimization with hybrid constraint-handling technique
AbstractIn constrained optimization evolutionary algorithms (COEAs), constraint-handling technique is used to balance the objective function and constraints, but how to achieve this balance is a very important problem. We found that the information of ...
Highlights- The hybrid constraint-handling technique (HCT) is proposed.
- The elite replacement strategy is proposed.
- Information of the population during the evolution process is used effectively.
- The criterion for judging that the ...
An Adaptive Tradeoff Model for Constrained Evolutionary Optimization
In this paper, an adaptive tradeoff model (ATM) is proposed for constrained evolutionary optimization. In this model, three main issues are considered: (1) the evaluation of infeasible solutions when the population contains only infeasible individuals; (...
Comments