×

A theoretical analysis on the bound violation probability in differential evolution algorithm. (English) Zbl 1521.90114

Georgiev, Ivan (ed.) et al., Numerical methods and applications. 10th international conference, NMA 2022, Borovets, Bulgaria, August 22–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13858, 233-245 (2023).
Summary: This 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 components exceed the lower or upper bound. The infeasible components become the subject of a correction method, that deflects the algorithm from its canonical behavior. The repairing strategy considered in this work is a stochastic variant of the projection to bounds strategy, known as “exponentially confined”. The main aim of this study is to determine the analytical expression of the bound violation probability of components generated by mutation operator in conjunction with “exponentially confined”.
For the entire collection see [Zbl 1511.65004].

MSC:

90C56 Derivative-free methods and methods using generalized derivatives
90C59 Approximation methods and heuristics in mathematical programming
47N10 Applications of operator theory in optimization, convex analysis, mathematical programming, economics
68W50 Evolutionary algorithms, genetic algorithms (computational aspects)
Full Text: DOI

References:

[1] Ali, MM; Fatti, LP, A differential free point generation scheme in the differential evolution algorithm, J. Global Optim., 35, 4, 551-572 (2006) · Zbl 1133.90377 · doi:10.1007/s10898-005-3767-y
[2] Arabas, J.; Szczepankiewicz, A.; Wroniak, T.; Schaefer, R.; Cotta, C.; Kołodziej, J.; Rudolph, G., Experimental comparison of methods to handle boundary constraints in differential evolution, Parallel Problem Solving from Nature, PPSN XI, 411-420 (2010), Heidelberg: Springer, Heidelberg · doi:10.1007/978-3-642-15871-1_42
[3] Gandomi, AH; Kashani, AR; Zeighami, F., Retaining wall optimization using interior search algorithm with different bound constraint handling, Int. J. Numer. Anal. Meth. Geomech., 41, 1304-1331 (2017) · doi:10.1002/nag.2678
[4] Helwig, S., Wanka, R.: Particle swarm optimization in high-dimensional bounded search spaces. In: IEEE Swarm Intelligence Symposium, pp. 198-205 (2007)
[5] Kashani, A.R., Chiong, R., Dhakal, S., Gandomi, A.H.: Investigating bound handling schemes and parameter settings for the interior search algorithm to solve truss problems. In: Engineering Reports, 3(10), p. e12405 (2021)
[6] Kreischer, V., Magalhaes, T.T., Barbosa, H.J., Krempser, E.: Evaluation of bound constraints handling methods in differential evolution using the cec2017 benchmark. In: XIII Brazilian Congress on Computational Intelligence (2017)
[7] van Stein, B., Caraffini, F., Kononova, A.V.: Emergence of structural bias in differential evolution. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1234-1242 (2021)
[8] Kononova, AV; Caraffini, F.; Bäck, T., Differential evolution outside the box, Inf. Sci., 581, 587-604 (2021) · Zbl 1533.68428 · doi:10.1016/j.ins.2021.09.058
[9] Padhye, N.; Mittal, P.; Deb, K., Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization, Comput. Optim. Appl., 62, 3, 851-890 (2015) · Zbl 1337.90065 · doi:10.1007/s10589-015-9752-6
[10] Storn, R.; Price, K., Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces, J. Global Optim., 11, 4, 341-359 (1997) · Zbl 0888.90135 · doi:10.1023/A:1008202821328
[11] Zaharie, D., Micota, F.: Revisiting the analysis of population variance in Differential Evolution algorithms. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 1811-1818 (2017)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.