Abstract
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.
Keywords
- Genetic Algorithm
- Topology Optimization
- Boundary Traction
- Decision Vector
- Multiobjective Evolutionary Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C.D. Chapman, K. Saitou and M. J. Jakiela: Genetic Algorithms as an Approach to Configuration and Topology Design. ASME Journal of Mechanical Design, (1994).
J.L. Cohon: Multiobjective programming and planning. Matematics in Science and Engineering, Vol. 140, Academic Press, Inc., (1978).
K. Deb: Evolutionary algorithms for multi-criterion optimization in engineering design. Proceedings of Evolutionary Algorithms in Engineering and computer Science, (EUROGEN’99), (1999).
K. Deb, A. Pratap, S. Agrawal and T. Meyarivan: A fast elitist Non-dominated sorting genetic algorithm for multi-objective: NSGA-II. Proceedings of the Parallel Problem Solving from Nature VI conference, pp 846–858, (2000).
K. Deb and T. Goel: Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence. Evolutionary Multi-Criterion Optimization, EMO 2001, Springer, pp 67–81, (2001).
K. Deb: Multi-Objective Optimization using Evolutionary Algorithms. Wiley, (2002).
C.M. Fonseca and P.J. Fleming: Genetic algorithms for multi-objective optimization: Formulation, discussion, and generalization. Proceedings of the fifth international conferance on Genetic Algorithms, 416–423, (1993).
D.E. Goldberg: Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, Massachusetts: Addison Wesley, (1989).
P. Hajela: Genetic Algorithms In Structural Topology Optimization. Topology Design of Structures, NATO Advanced Research Workshop, Sesimbra, Portugal, (1992).
Jonh Holland: Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press, (1975).
J. Horn, N. Nafploitis and D.E. Goldberg: A niched Pareto genetic algorithm for multi-objective optimization. Proceedings of the first IEEE conference on evolutionary computation, 82–87.
J. Knowles and D. Corne: The Pareto archived evolution strategy: A new baseline algorithm for multi-objective optimization. Proceedings of the 1999 congress on evolutionary computation, Piscataway: New Jersey: IEEE Service Center, 98–105, (1999).
V. Pareto: Cours D’Economie Politique. Vol. I and II, F. Rouge, Lausanne, (1896).
J.D. Schaffer: Multiple objective optimization with vector evaluated genetic algorithms, Ph.D.Thesis, Vanderbilt University, (1984).
J.D. Schaffer: Multiple objective optimization with vector evaluated genetic algorithms and Their Applications, Proceedings of the first international conferance on Genetic Algorithms, pp. 93–100, (1985).
N. Srinivas and K. Deb: Multi-objective funcion optimization using non-dominated sorting genetic algorithms, Evolutionary Computation(2), pp. 221–248, (1995).
E. Zitzler and L. Thiele: Multiobjective evolutionary algorithm: a comparative case study and the strength Pareto approach. IEEE Transation on Evolutionary Computation, 3(4), pp. 257–271, (1999).
A. Osyczka: Computer aided multicriterion optimization system (camos), software package in fortran. International Software Publisher (1992).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aguilar Madeira, J.F., Rodrigues, H., Pina, H. (2003). Genetic Methods in Multi-objective Optimization of Structures with an Equality Constraint on Volume. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_54
Download citation
DOI: https://doi.org/10.1007/3-540-36970-8_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-01869-8
Online ISBN: 978-3-540-36970-7
eBook Packages: Springer Book Archive