Genetic operators for two-dimentional shape optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1063, Issue , 1996, Pages 355-369

  Kane, Couro ^a   Schoenauer, Marc ^a  

^a CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; ONE DIMENSIONAL;

COMPUTATIONAL COSTS; CROSSOVER OPERATOR; EXPERIMENTAL TEST; GENETIC ALGORITHM APPROACH; GENETIC OPERATORS; MUTATION OPERATORS; OPTIMUM DESIGNS; REAL-WORLD PROBLEM;

SHAPE OPTIMIZATION;

EID: 84949226860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61108-8_50     Document Type: Conference Paper

References (24)

1. [AK93] G. Allaire and R. V. Kohn. Optimal design for minimum weight and compliance in plane stress using extremal microstructures. European Journal of Mechanics, A/Solids, 12(6):839-878, 1993.
2. [Ant89] J. Antonisse. A new interpretation of schema notation that overturns the binary encoding constraint. In J. D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 86-91. Morgan Kaufmann, June 1989.
3. [BK88] M. Bendsoe and N. Kikushi. Generating optimal topologies in structural design using a homogenization method. Computer Methods in Applied Mechanics and Engineering, 71:197-224, 1988.
4. [Cal91] D. L. Calloway. Using a genetic algorithm to design binary phase-only filters for pattern recognition. In R. K. Belew and L. B. Booker, editors, Proceedings of the 4th International Conference on Genetic Algorithms. Morgan Kaufmann, 1991.
5. [CS88] R. A. Caruna and J. D. Schaffer. Representation and hidden bias: Gray vs binary coding for genetic algorithms. In Proceedings of ICML-88, International Conference on Machine Learning. Morgan Kaufmann, 1988.
6. [CSJ94] C. D. Chapman, K. Saitou, and M. J. Jakiela. Genetic algorithms as an approach to configuration and topology design. Journal of Mechanical Design, 116:1005-1012, 1994.
7. [GMP95] C. Ghaddar, Y. Maday, and A. T. Patera. Analysis of a part design procedure. Submitted to Nümerishe Mathematik, 1995.
8. [Gol89] D. E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison Wesley, 1989.
9. [Gre87] J. J. Grefenstette. Incorporating problem specific knowledge in genetic algorithms. In Davis L., editor, Genetic Algorithms and Simulated Annealing, pages 42-60. Morgan Kaufmann, 1987.
10. [Gre95] J. J. Grefenstette. Virtual genetic algorithms: First results. Technical Report AIC-95-013, Navy Center for Applied Research in Artificial Intelligence, February 1995.
11. [Hol75] J. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, 1975.
12. [Jen92] E. Jensen. Topological Structural Design using Genetic Algorithms. PhD thesis, Purdue University, November 1992.
13. [JM91] C. Z. Janikow and Z. Michalewicz. An experimental comparison of binary and floating point representations in genetic algorithms. In R. K. Belew and L. B. Booker, editors, Proceedings of 4th International Conference on Genetic Algorithms, pages 31-36. Morgan Kaufmann, July 1991.
14. [Kan95] C. Kane. Algorithm.es génétiques et Optimisation topologique. PhD thesis, Université de Paris VI, 1995. Soutenance prévue en 1996.
15. [KJS95] C. Kane, F. Jouve, and M. Schoenauer. Structural topology optimization in linear and nonlinear elasticity using genetic algorithms. In Proceedings of the ASME 21st Design Automation Conference. ASME, Sept. 1995.
16. [MJ91] Z. Michalewicz and C. Z. Janikow. Handling constraints in genetic algorithms. In R. K. Belew and L. B. Booker, editors, Proceedings of the 4th International Conference on Genetic Algorithms, pages 151-157, 1991.
17. [Rad91] N. J. Radcliffe. Equivalence class analysis of genetic algorithms. Complex Systems, 5:183-20, 1991
18. [RS94] N. J. Radcliffe and P. D. Surry. Fitness variance of formae and performance prediction. In D. Whitley and M. Vose, editors, Foundations of Genetic Algorithms 3, pages 51-72. Morgan Kaufmann, 1994.
19. [Sch81] H.-P. Schwefel. Numerical Optimization of Computer Models. John Wiley ik Sons, New-York, 1981.
20. [Spe91] W. M. Spears. Adapting crossover in a genetic algorithm. In R. K. Belew and L. B. Booker, editors, Proceedings of the 4th International Conference on Genetic Algorithms. Morgan Kaufmann, 1991.
21. [Spe95] W. M. Speaxs. Adapting crossover in evolutionary algorithms. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 367-384. MIT Press, March 1995.
22. [SS94] M. Sebag and M. Schoenauer. Controling crossover through inductive learning. In Y. Davidor, H.-P. Schwefel, and R. Manner, editors, Proceedings of the 3rd Conference on Parallel Problems Solving from Nature, pages 209-218. Springer-Verlag, LNCS 866, October 1994.
23. [Sys89] G. Syswerda. Uniform crossover in genetic algorithms. In J. D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 2-9. Morgan Kaufmann, 1989.
24. [WSF89] D. Whitley, T. Starkweather, and D. Fuquay. Scheduling problems and travelling salesman: The genetic edge recombination operator. In J. D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann, 1989.