Mădălina-Andreea Mitran
Anna Kononova
Fabio Caraffini
ABSTRACT
This study investigates the influence of several bound constraint handling methods (BCHMs) on the search process specific to Differential Evolution (DE), with a focus on identifying similarities between BCHMs and grouping patterns with respect to the number of cases when a BCHM is activated. The empirical analysis is conducted on the SBOX-COST benchmarking test suite, where bound constraints are enforced on the problem domain. This analysis provides some insights that might be useful in designing adaptive strategies for handling such constraints.
- M. M. Ali and L. P. Fatti. 2006. A Differential Free Point Generation Scheme in the Differential Evolution Algorithm. J. Glob. Optim. 35, 4 (2006), 551--572. Google Scholar
Digital Library
- Jaroslaw Arabas, Adam Szczepankiewicz, and Tomasz Wroniak. 2010. Experimental Comparison of Methods to Handle Boundary Constraints in Differential Evolution. 6239 (2010), 411--420. Google ScholarCross Ref
- Rafał Biedrzycki. 2020. Handling bound constraints in CMA-ES: An experimental study. Swarm and Evolutionary Computation 52 (2020), 100627. Google ScholarCross Ref
- Rafal Biedrzycki, Jaroslaw Arabas, and Dariusz Jagodzinski. 2019. Bound constraints handling in Differential Evolution: An experimental study. Swarm Evol. Comput. 50 (2019). Google ScholarCross Ref
- Rick Boks, Anna V. Kononova, and Hao Wang. 2021. Quantifying the impact of boundary constraint handling methods on differential evolution. In GECCO '21: Genetic and Evolutionary Computation Conference, Companion Volume, Lille, France, July 10--14, 2021, Krzysztof Krawiec (Ed.). ACM, 1199--1207. Google ScholarDigital Library
- Janez Brest and Mirjam Sepesy Maučec. 2008. Population size reduction for the differential evolution algorithm. Applied Intelligence 29, 3 (2008), 228--247.Google ScholarDigital Library
- Fabio Caraffini, Anna V. Kononova, and David Corne. 2019. Infeasibility and structural bias in differential evolution. Information Sciences 496 (2019), 161--179. Google ScholarDigital Library
- S. Das, Sankha Subhra Mullick, and P.N. Suganthan. 2016. Recent advances in differential evolution - An updated survey. Swarm and Evolutionary Computation 27 (2016), 1 -- 30. Google ScholarCross Ref
- Sebastián-José de-la-Cruz-Martínez and Efrén Mezura-Montes. 2020. Boundary Constraint-Handling Methods in Differential Evolution for Mechanical Design Optimization. In IEEE Congress on Evolutionary Computation (CEC). IEEE, 1--8. Google ScholarDigital Library
- Carola Doerr, Hao Wang, Furong Ye, Sander van Rijn, and Thomas Bäck. 2018. IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics. arXiv e-prints:1810.05281 (oct 2018). arXiv:1810.05281 https://arxiv.org/abs/1810.05281Google Scholar
- Nikolaus Hansen, Anne Auger, Raymond Ros, Olaf Mersmann, Tea Tušar, and Dimo Brockhoff. 2021. COCO: a platform for comparing continuous optimizers in a black-box setting. Optimization Methods and Software 36, 1 (2021), 114--144. arXiv:https://doi.org/10.1080/10556788.2020.1808977 Google ScholarCross Ref
- Sabine Helwig, Jürgen Branke, and Sanaz Mostaghim. 2013. Experimental Analysis of Bound Handling Techniques in Particle Swarm Optimization. IEEE Transactions on Evolutionary Computation 17, 2 (2013), 259--271. Google ScholarDigital Library
- Sabine Helwig and Rolf Wanka. 2008. Theoretical Analysis of Initial Particle Swarm Behavior. In Parallel Problem Solving from Nature - PPSN X, Günter Rudolph, Thomas Jansen, Nicola Beume, Simon Lucas, and Carlo Poloni (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 889--898.Google Scholar
- Efrén Juárez-Castillo, Héctor-Gabriel Acosta-Mesa, and Efrén Mezura-Montes. 2017. Empirical study of bound constraint-handling methods in Particle Swarm Optimization for constrained search spaces. In 2017 IEEE Congress on Evolutionary Computation. IEEE, 604--611. Google ScholarDigital Library
- Efrén Juárez-Castillo, Héctor-Gabriel Acosta-Mesa, and Efrén Mezura-Montes. 2019. Adaptive boundary constraint-handling scheme for constrained optimization. Soft Comput. 23, 17 (2019), 8247--8280. Google ScholarDigital Library
- Tomas Kadavy, Adam Viktorin, Anezka Kazikova, Michal Pluhacek, and Roman Senkerik. 2022. Impact of Boundary Control Methods on Bound-Constrained Optimization Benchmarking. IEEE Transactions on Evolutionary Computation 26, 6 (2022), 1271--1280. Google ScholarCross Ref
- Anna V. Kononova, Fabio Caraffini, and Thomas Bäck. 2021. Differential evolution outside the box. Information Sciences 581 (2021), 587--604. Google ScholarDigital Library
- Anna V. Kononova, Diederick Vermetten, Fabio Caraffini, Madalina-A. Mitran, and Daniela Zaharie. 2022. The importance of being constrained: dealing with infeasible solutions in Differential Evolution and beyond. arXiv:2203.03512 [cs.NE]Google Scholar
- Vinicius Kreischer, Thiago Tavares Magalhaes, HJ Barbosa, and Eduardo Krempser. 2017. Evaluation of bound constraints handling methods in differential evolution using the cec2017 benchmark. In XIII Brazilian Congress on Computational Intelligence.Google Scholar
- Elre T. Oldewage, Andries P. Engelbrecht, and Christopher Wesley Cleghorn. 2018. Boundary Constraint Handling Techniques for Particle Swarm Optimization in High Dimensional Problem Spaces. In Swarm Intelligence - 11th International Conference (Lecture Notes in Computer Science, Vol. 11172). 333--341. Google ScholarCross Ref
- Nikhil Padhye, Pulkit Mittal, and Kalyanmoy Deb. 2015. Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization. Computational Optimization and Applications 62 (2015), 851--890. Google ScholarDigital Library
- Kenneth V. Price, Rainer Storn, and Jouni Lampinen. 2005. Differential Evolution: A Practical Approach to Global Optimization. Springer, Berlin, Heidelberg. Google ScholarCross Ref
- Ponnuthurai Nagaratnam Suganthan. [n.d.]. Benchmarks for Evaluation of Evolutionary Algorithms. https://www3.ntu.edu.sg/home/epnsugan/index_files/cec-benchmarking.htm. Accessed: 2023-04-10.Google Scholar
- Ryoji Tanabe and Alex Fukunaga. 2013. Success-history based parameter adaptation for Differential Evolution. In 2013 IEEE Congress on Evolutionary Computation. 71--78. Google ScholarCross Ref
- Ryoji Tanabe and Alex S Fukunaga. 2014. Improving the search performance of SHADE using linear population size reduction. In 2014 IEEE Congress on Evolutionary Computation (CEC). IEEE, IEEE, 1658--1665.Google ScholarCross Ref
- Niki Vecek, Marjan Mernik, and Matej Crepinsek. 2014. A chess rating system for evolutionary algorithms: A new method for the comparison and ranking of evolutionary algorithms. Inf. Sci. 277 (2014), 656--679. Google ScholarCross Ref
- Hao Wang, Diederick Vermetten, Furong Ye, Carola Doerr, and Thomas Bäck. 2022. IOHanalyzer: Detailed Performance Analyses for Iterative Optimization Heuristics. ACM Trans. Evol. Learn. Optim. 2, 1, Article 3 (apr 2022), 29 pages. Google ScholarDigital Library
- Simon Wessing. 2013. Repair Methods for Box Constraints Revisited. Lecture Notes in Computer Science, Vol. 7835. Springer, Berlin, Heidelberg, 469--478. Google ScholarDigital Library
- Jingqiao Zhang and Arthur C. Sanderson. 2009. JADE: Adaptive Differential Evolution With Optional External Archive. IEEE Transactions on Evolutionary Computation 13, 5 (2009), 945--958. Google ScholarDigital Library
Index Terms
- Patterns of Convergence and Bound Constraint Violation in Differential Evolution on SBOX-COST Benchmarking Suite
Recommendations
Analysis of modular CMA-ES on strict box-constrained problems in the SBOX-COST benchmarking suite
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary ComputationBox-constraints limit the domain of decision variables and are common in real-world optimization problems, for example, due to physical, natural or spatial limitations. Consequently, solutions violating a box-constraint may not be evaluable. This ...
A differential evolution algorithm with constraint sequencing
Graphical abstractDisplay Omitted HighlightsAn optimization algorithm is introduced based on a partial evaluation policy.The population are evaluated based on a random sequence of constraints.The search using multiple constraint sequences offers the ...
A Theoretical Analysis on the Bound Violation Probability in Differential Evolution Algorithm
Numerical Methods and ApplicationsAbstractThis study is focused on Differential Evolution (DE) algorithm in the context of solving continuous bound-constrained optimization problems. The mutation operator involved in DE might lead to infeasible elements, i.e. one or all of their ...
Comments