Abstract
Over recent decades, several efficient constraint-handling methods have been proposed in the area of evolutionary computation, and the \(\varepsilon \) constraint method is considered as a state-of-the-art method for both single and multiobjective optimization. Still, very few attempts have been made to improve this method when applied to the differential evolution algorithm. This study proposes several novel constraint-handling methods following similar ideas, where the \(\varepsilon \) level is defined based on the current violation in the population, individual \(\varepsilon \) levels are maintained for every constraint, and a combination of fitness and constraint violation is used for determining infeasible solutions. The proposed approaches demonstrate superior performance compared to other approaches in terms of the feasibility rate in high-dimensional search spaces, as well as convergence to global optima. The experiments are performed using the CEC’2017 constrained suite benchmark functions and a set of Economic Load Dispatch problems.
Similar content being viewed by others
References
Al-Dabbagh RD, Neri F, Idris N, Baba MS (2018) Algorithmic design issues in adaptive differential evolution schemes: review and taxonomy. Swarm Evol Comput 43:284–311
Bäck T, Hoffmeister F, Schwefel H-P (1991) A survey of evolution strategies. In: Proceedings of the 4th international conference on genetic algorithms, San Diego, CA, USA, July 1991, pp 2–9
Brest J, Maučec M, Boškovic B (2017) Single objective real-parameter optimization algorithm jSO. In: Proceedings of the IEEE congress on evolutionary computation. IEEE Press, pp 1311–1318
Cai Z, Wang Y (2006) A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Trans Evol Comput 10(6):658–675
Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11):1245–1287
Das S, Suganthan PN (2010) Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Technical report
Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2):311–338
Fan Z, Li H, Wei C, Li W, Huang H, Cai X, Cai Z (2016) An improved epsilon constraint handling method embedded in MOEA/D for constrained multi-objective optimization problems. In: 2016 IEEE symposium series on computational intelligence (SSCI), Athens, pp 1–8
Fan Z, Fang Y, Li W, Yuan Y, Wang Z, Bian X (2018) LSHADE44 with an improved constraint-handling method for solving constrained single-objective optimization problems. In: IEEE congress on evolutionary computation (CEC), Rio de Janeiro, pp 1–8
Fan Z, Li W, Cai X, Li H, Wei C, Zhang Q, Deb K, Goodman E (2019) Push and pull search for solving constrained multi-objective optimization problems. Swarm Evol Comput 44:665–679
Farmani R, Wright JA (2003) Self-adaptive fitness formulation for constrained optimization. IEEE Trans Evol Comput 7:445–455
Hellwig M , Beyer H (2018) A matrix adaptation evolution strategy for constrained real parameter optimization. In: 2018 IEEE congress on evolutionary computation (CEC), pp 1–8
Hellwig M, Beyer H-G (2019) Benchmarking evolutionary algorithms for single objective real-valued constrained optimization—a critical review. Swarm Evol Comput 44:927–944
Homaifar A, Qi CX, Lai SH (1994) Constrained optimization via genetic algorithms. Simulation 62(4):242–253
Joines JA, Houck CR (1994) On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with ga’s. In: Proceedings of the first IEEE conference on evolutionary computation. IEEE world congress on computational intelligence, vol 2, pp 579–584
Mallipeddi R, Suganthan PN (2010) Ensemble of constraint handling techniques. IEEE Trans Evol Comput 14(4):561–579
Mezura-Montes E, Coello CAC (2011) Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol Comput 1(4):173–194
Mora A, Squillero G, Agapitos A, Burelli P, Bush W, Cagnoni S, Cotta C, Falco I, Della Cioppa A, Divina F, Eiben A, Esparcia-Alcǎzar A, Vega F, Glette K, Haasdijk E, Hidalgo I, Kampouridis M, Kaufmann P, Mavrovouniotis M, Zhang M (2015) Applications of evolutionary computation—18th European conference, EvoApplications
Polakova RL (2017) SHADE with competing strategies applied to constrained optimization. In: IEEE Congress on evolutionary computation (CEC), San Sebastian, pp 1683–1689
Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284–294
Runarsson TP, Yao X (2005) Search biases in constrained evolutionary optimization. IEEE Trans Syst Man Cybern C Appl Rev 35(2):233–243
Singh HK, Alam K, Ray T (2016) Use of infeasible solutions during constrained evolutionary search: a short survey. In: Proceedings of the second Australasian conference on artificial life and computational intelligence, vol 9592. Springer, Berlin, pp 193–205
Stanovov V, Akhmedova S, Semenkin E (2018a) LSHADE algorithm with rank-based selective pressure strategy for solving CEC 2017 benchmark problems. In: 2018 IEEE congress on evolutionary computation (CEC), p 1–8
Stanovov V, Akhmedova S, Semenkin E (2018b) Selective pressure strategy in differential evolution: exploitation improvement in solving global optimization problems. Swarm Evol Comput 50:100463
Takahama T, Sakai S (2005) Constrained optimization by \(\epsilon \) constrained particle swarm optimizer with \(\epsilon \)-level control. In: Soft computing as transdisciplinary science and technology. Springer, Berlin, pp 1019–1029
Takahama T, Sakai S (2006) Constrained optimization by the \(\epsilon \) constrained differential evolution with gradient-based mutation and feasible elites. In: 2006 IEEE international conference on evolutionary computation, pp 1–8
Tanabe R, Fukunaga A (2013) Success-history based parameter adaptation for differential evolution. In: Proceedings of the IEEE congress on evolutionary computation. IEEE Press, pp 71–78
Tanabe R, Fukunaga A (2014) Improving the search performance of SHADE using linear population size reduction. In: Proceedings of the IEEE congress on evolutionary computation. CEC, Beijing, pp 1658–1665
Tessema BG, Yen GG (2006) A self adaptive penalty function based algorithm for constrained optimization. In: 2006 IEEE international conference on evolutionary computation, pp 246–253
Trivedi A, Sanyal K, Verma P, Srinivasan DA (2017) Unified differential evolution algorithm for constrained optimization problems. In: 2017 IEEE congress on evolutionary computation (CEC), pp 1231–1238
Trivedi A, Srinivasan D, Biswas N (2018) Improved unified differential evolution algorithm for constrained optimization problems. Technical report
Tvrdík J, Polakova R (2017) A simple framework for constrained problems with application of l-shade44 and ide. In: 2017 IEEE congress on evolutionary computation (CEC), pp 1436–1443 (2017)
Wang Y, Cai Z, Zhou Y, Zeng W (2008) An adaptive tradeoff model for constrained evolutionary optimization. IEEE Trans Evol Comput 12:80–92
Wu G, Mallipeddi R, Suganthan PN (2016) Problem definitions and evaluation criteria for the CEC 2017 competition and special session on constrained single objective real-parameter optimization. Technical report
Zamuda A, Sosa JDH, Adler L (2016) Constrained differential evolution optimization for underwater glider path planning in sub-mesoscale eddy sampling. Appl Soft Comput 42:93–118
Acknowledgements
Research is performed with the support of the Ministry of Education and Science of the Russian Federation within State Assignment [Project \(\#\) 2.1680.2017/(project part), 2017].
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Communicated by A. Di Nola.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Stanovov, V., Akhmedova, S. & Semenkin, E. Combined fitness–violation epsilon constraint handling for differential evolution. Soft Comput 24, 7063–7079 (2020). https://doi.org/10.1007/s00500-020-04835-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-020-04835-6