Genetic Methods in Multi-objective Optimization of Structures with an Equality Constraint on Volume

The method is developed for multi-objective optimization problems. Its purpose is to evolve an evenly distributed group of solutions to determine the optimum Pareto set for a given problem. The algorithm determines a set of solutions (a population), this population being sorted by its domination properties and a filter is defined in order to retain the Pareto solutions. In most topology design problem volume is in general a constraint of the problem. Due to this constraint, all chromosomes used in the genetic algorithm must generate individuals with the same volume value; in the coding adopted this means that they must preserve the same number of ones and, implicitly, the same number of zeros, along the evolutionary process. It is thus necessary to define these chromosomes and to create corresponding operators of crossover and mutation which preserve volume. To reduce computational effort, optimal solutions of each of the single-objective problems are introduced in the initial population. Results obtained by the evolutionary and classical methods are compared.

[1]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[2]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[3]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[4]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[5]  Kalyanmoy Deb,et al.  Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence , 2001, EMO.

[6]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[7]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[8]  Kalyanmoy Deb,et al.  MULTI-OBJECTIVE FUNCTION OPTIMIZATION USING NON-DOMINATED SORTING GENETIC ALGORITHMS , 1994 .

[9]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[10]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[12]  Kalyanmoy Deb,et al.  Evolutionary Algorithms for Multi-Criterion Optimization in Engineering Design , 1999 .

[13]  Prabhat Hajela,et al.  Genetic Algorithms in Structural Topology Optimization , 1993 .

[14]  Jared L. Cohon,et al.  Multiobjective programming and planning , 2004 .

[15]  Kazuhiro Saitou,et al.  Genetic algorithms as an approach to configuration and topology design , 1994, DAC 1993.

[16]  Charles Gide,et al.  Cours d'économie politique , 1911 .

[17]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[18]  Andrzej Osyczka,et al.  Computer aided multicriterion optimization system (CAMOS) : software package in FORTRAN , 1992 .

[19]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .