Self-adaptation procedures in genetic algorithms applied to the optimal design of composite structures
Source abstract
Abstract
It is recognized that the efficiency of Genetic Algorithms improves if some adaptive rules are included. In this work, adaptive properties in Genetic Algorithms applied to structural optimization are studied. The adaptive rules work by using additional information related to the behavior of state and design variables of the structural problem. At each generation, the self-adaptation of the genetic parameters to evolutionary conditions attempts to improve the efficiency of the genetic search. The introduction of adaptive rules occurs at three levels: (i) when defining the search domain in each generation; (ii) considering a crossover operator based on commonality and local improvements; and (iii) by controlling mutation, including behavioral data. Self-adaptation has proved to be highly beneficial in automatically and dynamically adjusting evolutionary parameters. Numerical examples showing these benefits are presented.
Source: openaire · Quality: candidate unverified · Source record ↗
Research context
OpenAlex topics: Topology Optimization in Engineering · Advanced Multi-Objective Optimization Algorithms · Metaheuristic Optimization Algorithms Research
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (18)
Show source-provided references
1. Aizawa, J., Hsu, C., Yamada, S., Fujikawa, H., Shida, K.: An effectiveness analysis of genetic operators for TSP. In: Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany, pp. 465–469 (1998)
2. Back, T., Schwefel, H.: An overview of evolutionary algorithms for parallel optimization. Evol. Comput. 1(1), 1–23 (1993). doi: 10.1162/evco.1993.1.1.110.1162/evco.1993.1.1.1 ↗
3. Chun, J.-S., Kim, M.-K., Jung, H.-K.: Shape optimization of electromagnetic devices using Immune Algorithm. IEEE Trans. Magn. 33(2), 1876–1879 (1997). doi: 10.1109/20.58265010.1109/20.582650 ↗
4. Conceição António, C.A.: A multilevel genetic algorithm for optimization of geometrically non-linear stiffened composite structures. Struct. Multidiscip. Optim. 24, 372–386 (2002). doi: 10.1007/s00158-002-0249-410.1007/s00158-002-0249-4 ↗
5. Conceição António, C.A.: A hierarchical genetic algorithm with age structure for multimodal optimal design of hybrid composites. Struct. Multidiscip. Optim. 31, 280–294 (2006). doi: 10.1007/s00158-005-0570-910.1007/s00158-005-0570-9 ↗
6. Conceição António, C.A.: A study on synergy of multiple crossover operators in a hierarchical genetic algorithm applied to structural optimization. Struct. Multidiscip. Optim. (2008a) (in press). doi: 10.1007/s00158-008-0268-x10.1007/s00158-008-0268-x ↗
7. Conceição António: Carlos, “Self-adaptation in genetic algorithms applied to structural optimization”, EngOpt 2008—International Conference on Engineering Optimization, Rio de Janeiro, Brasil, 1–5 June, 2008, Session: Evolutionary Techniques, Book of abstracts: p. 43, CD edition: Paper nr. 158, (2008b)
8. Davis, L.: Adapting operator probabilities in genetic algorithms. In: Proceedings of the 3rd International Conference on Genetic Algorithms, San Mateo CA, USA, pp. 61–60 (1989)
9. Eiben, A.E., Sprinkhuizen-Kuyper, I.G., Thijssen, B.A.: Competing crossovers in an adaptive GA framework. In: Proceedings of the IEEE Conference on Evolutionary Computation, Anchorage AK, USA, pp. 787–792 (1998)10.1109/ICEC.1998.700152 ↗
10. Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison Wesley, Reading, MA (1989)
11. Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. Found. Genet. Algorithms 1, 69–93 (1991)10.1016/B978-0-08-050684-5.50008-2 ↗
12. Herrera, F., Lozano, M., Sánchez, A.M.: A taxonomy for the crossover operator for real-coded genetic algorithms. Int. J. Intell. Syst. 18, 309–338 (2003). doi: 10.1002/int.1009110.1002/int.10091 ↗
13. Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)
14. Schaffer, J., Caruana, R., Eshelman, L., Das, R.: A study of control parameters affecting online performance of genetic algorithms for function optimization. In: Proceedings of the 3rd International Conference on Genetic Algorithms, San Mateo CA, pp. 51–60 (1989)
15. Spears, W.M., DeJong, S.K.: On the virtues of parameterized uniform crossover. In: Proceedings of the 4th International Conference on Genetic Algorithms, San Mateo CA, USA, pp. 230–236 (1991)
16. Tuson, A., Ross, P.: Adapting operator settings in genetic algorithms. Evol. Comput. 6, 161–184 (1998). doi: 10.1162/evco.1998.6.2.16110.1162/evco.1998.6.2.161 ↗
17. Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67–82 (1997). doi: 10.1109/4235.58589310.1109/4235.585893 ↗
18. Yoon, H.-S., Moon, B.-R.: An empirical study on the synergy of multiple crossover operators. IEEE Trans. Evol. Comput 6, 212–223 (2002). doi: 10.1109/4235.99602210.1109/4235.996022 ↗