Abstract
Development of crossover operators is based on three different mechanisms: mating selection mechanism, offspring generation mechanism and offspring selection mechanism. Most crossover operators are able to get exploration or exploitation of the domain depending on the way they handle the current diversity of the population. Each crossover operator directs the search towards a different region in the neighbourhood of the parents. The quality of the elements belonging to the visited region depends on the particular problem to be solved. This is confirmed by the well known No Free Lunch (NFL) theorems. The simultaneous use of diverse crossover operators on the population may induce more efficient algorithms. The aim of this paper is to analyse and to study complementary properties resulting from synergy effects using several crossover operators in particular for a hierarchical genetic algorithm. The reached improvements using multiple crossover operators will be analysed through some standard optimisation examples of hybrid composite structures.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aizawa J, Hsu C, Yamada S, Fujikawa H, Shida K (1998) An effectiveness analysis of genetic operators for TSP, 6th Eur. congr. intelligent techniques and soft computing, vol 1. Aachen, Germany, pp 465–469
Conceição António CA (2001) A hierarchical genetic algorithm for reliability based design of geometrically non-linear composite structures. Compos Struct 54:37–47
Conceição António CA (2002) A multilevel genetic algorithm for optimization of geometrically non-linear stiffened composite structures. Struct Multidiscipl Optim 24:372–386
Conceição António CA (2006) A hierarchical genetic algorithm with age structure for multimodal optimal design of hybrid composites. Struct Multidiscipl Optim 31:280–294
Conceição António CA, Lhate IA (2003) A hybrid cross over operator for structural optimization based on commonality in genetic search. Engineering Computations, International Journal for Computer-Aided Engineering and Software 20:390–408
Deb K, Anand A, Joshi D (2002) A computationally efficient evolutionary algorithm for real-parameter evolution. Evol Comput J 10:371–395
Eiben AE, Sprinkhuizen-Kuyper IG, Thijssen BA (1998) Competing crossovers in an adaptive GA framework. IEEE conf. evolutionary computation. Anchorage, AK, USA, pp 787–792
Eshelman LJ, Caruana A, Schaffer JD (1989) Biases in the crossover landscape. In: Schaffer JD (ed) Proceedings of the third international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp 86–91
Herrera F, Lozano M (2000) Gradual distributed real-coded genetic algorithms. IEEE Trans Evol Comput 4:43–63
Herrera F, Lozano M, Verdegay JL (1998) Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artif Intell Rev 12:265–319
Herrera F, Lozano M, Sánchez AM (2003) A taxonomy for the crossover operator for real-coded genetic algorithms. Int J Intell Syst 18:309–338
Holland J (1975) Adaptation in natural and artificial system. The University of Michigan Press, Ann Arbor, MI
Hong I, Kahng AB, Moon BR (1995) Exploiting synergies of multiple crossovers: initial studies. IEEE conf. evolutionary computation. Perth, Australia, pp 245–250
Kita H, Kobayashi S (1999) Multi-parental extension of the uni-modal normal distribution crossover for real-coded genetic algorithms. International conference on evolutionary computation’99. IEEE, Piscataway, NJ, pp 646–651
Michallewicz Z, Nazhiyath GG, Michallewicz M (1996) A note on usefulness of geometrical crossover for numerical optimisation problems. Fifth annual conference on evolutionary programming. MIT, Cambridge, pp 305–312
Murata T, Ishibuchi H (1996) Positive and negative combination effects of crossover and mutation operators in sequencing problems. IEEE conf. evolutionary computation. Nagoya, Japan, pp 170–175
Spears WM (1995) Adapting crossover in evolutionary algorithms. In: McDonnell JR, Reynolds RG, Fogel DB (eds) Proceedings of 4th annual conference on evolutionary programming. MIT Press, Cambridge, MA, USA, pp 367–384
Spears WM, DeJong SK (1991) On the virtues of parameterized uniform crossover. In: Belew RK, Booker LB (eds) Proceedings of the fourth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp 230–236
Syswerda G (1989) Uniform crossover in genetic algorithms. In: Schaffer JD (ed) Proceedings of the third international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp 2–9
Tsutsui S, Yamamura M, Higuchi T (1999) Multi-parent recombination with simplex crossover in real-coded genetic algorithms. GECCO-99 Genetic and Evolutionary Computation Conference. Morgan Kaufmann, San Mateo, CA, pp 657–664
Tuson AL, Ross P (1998) Adapting operator settings in genetic algorithms. Evol Comput 6:161–184
Voigt HM, Mühlenbein H, Cvetkovic D (1995) Fuzzy recombination for the breeder genetic algorithm. In: Eshelman L (ed) Proceedings of the sixth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp 104–111
Wolpert DH, Macready WG (1997) No free lunch theorems for optimisation. IEEE Trans Evol Comput 1:67–82
Wright A (1991) Genetic algorithms for real parameter optimization. In Rawlin GEF (ed) Foundations of genetic algorithms 1. Morgan Kaufmann, San Mateo, CA, USA, pp 205–218
Yoon H-S, Moon B-R (2002) An empirical study on the synergy of multiple crossover operators. IEEE Trans Evol Comput 6:212–223
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
António, C.C. A study on synergy of multiple crossover operators in a hierarchical genetic algorithm applied to structural optimisation. Struct Multidisc Optim 38, 117–135 (2009). https://doi.org/10.1007/s00158-008-0268-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00158-008-0268-x