skip to main content
10.1145/3194206.3194215acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiciaiConference Proceedingsconference-collections
research-article

Solving constrained optimization problems by using covariance matrix adaptation evolutionary strategy with constraint handling methods

Authors Info & Claims
Published:09 March 2018Publication History

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.

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. Erskine, A., Joyce, T. and Herrmann, J. M. Stochastic stability of particle swarm optimisation. Swarm Intelligence(November 09 2017).Google ScholarGoogle Scholar
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. Kim, J.-H. and Myung, H. Evolutionary programming techniques for constrained optimization problems. Evolutionary Computation, IEEE Transactions on, 1, 2 1997), 129--140. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Goldberg, D. E. and Holland, J. H. Genetic Algorithms and Machine Learning. Machine Learning, 3, 2 (October 01 1988), 95--99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. {6} Hansen, N. The CMA Evolution Strategy: A Tutorial. City, 2005.Google ScholarGoogle Scholar
  7. Wolpert, D. H. and Macready, W. G. No free lunch theorems for optimization. Trans. Evol. Comp, 1, 1 1997), 67--82. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Arnold, D. V. a. H.-G. B. Investigation of the (μ, λ)-ES in the presence of noise City, 2001.Google ScholarGoogle Scholar
  9. Arnold, D. V. and Hansen, N. A (1+ 1)-CMA-ES for constrained optimisation. ACM, City, 2012.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle Scholar
  11. Abdolmaleki, A., Price, B., Lau, N., Reis, L. P. and Neumann, G. Deriving and improving CMA-ES with Information geometric trust regions2017).Google ScholarGoogle Scholar
  12. Jastrebski, G. A., Dalhousie, U. and Faculty of Computer, S. Improving evolution strategies through active covariance matrix adaptation. Halifax, N.S., 2005.Google ScholarGoogle Scholar
  13. 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 ScholarGoogle Scholar
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarCross RefCross Ref
  16. Kusakci, A. O. and Can, M. A novel evolution strategy for constrained optimization in engineering design. City, 2013.Google ScholarGoogle Scholar
  17. 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 ScholarGoogle ScholarCross RefCross Ref
  18. Hamida, S. B. and Schoenauer, M. ASCHEA: new results using adaptive segregational constraint handling. City, 2002.Google ScholarGoogle Scholar
  19. Takahama, T. a. S. S. Fast and stable constrained optimization by the ε constrained differential evolution. Pacific Journal of optimization2009), 261--282.Google ScholarGoogle Scholar
  20. 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 ScholarGoogle Scholar
  21. Takahama, T. and Sakai, S. Efficient Constrained Optimization by the ε Constrained Rank-Based Differential Evolution. City, 2012.Google ScholarGoogle Scholar
  22. Takahama, T. and Sakai, S. Solving Constrained Optimization Problems by the s Constrained Particle Swarm Optimizer with Adaptive Velocity Limit Control. City, 2006.Google ScholarGoogle Scholar
  23. Takahama, T. and Sakai, S. Constrained Optimization by the ε Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites. City, 2006.Google ScholarGoogle Scholar
  24. Mallipeddi, R. and Suganthan, P. N. Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems. City, 2010.Google ScholarGoogle Scholar
  25. 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 ScholarGoogle ScholarCross RefCross Ref
  26. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  27. Farmani, R. and Wright, J. A. Self-adaptive fitness formulation for constrained optimization. IEEE Transactions on Evolutionary Computation, 7, 5 2003), 445--455. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Tessema, B. and Yen, G. G. A Self Adaptive Penalty Function Based Algorithm for Constrained Optimization. City, 2006.Google ScholarGoogle Scholar
  29. 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 ScholarGoogle Scholar

Index Terms

  1. Solving constrained optimization problems by using covariance matrix adaptation evolutionary strategy with constraint handling methods

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICIAI '18: Proceedings of the 2nd International Conference on Innovation in Artificial Intelligence
      March 2018
      198 pages
      ISBN:9781450363457
      DOI:10.1145/3194206

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 9 March 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader