In this article we propose to introduce a new selection parameter in Genetic Algorithms (GAs) for a class of constrained reliability design problems. Our work demonstrates two major points. The first one is that the populations are quickly included in the space of the feasible solutions for a sufficiently large selection of parameter value. The second one is that the value of the selection parameter controls the exploration strategy of the feasible space. These two properties illustrate that an adapted choice of the selection parameter value allows to improve the performance of GA. Furthermore, our numerical examples tend to show that, with an adapted choice of the selection parameter, these GAs are in practice more efficient than previously proposed GAs for this class of problems. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Rigal, L., Castanier, B., & Castagliola, P. (2004). Introduction of a new selection parameter in genetic algorithm for constrained reliability design problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3103, 90–101. https://doi.org/10.1007/978-3-540-24855-2_9
Mendeley helps you to discover research relevant for your work.