Skip to main content
SpringerLink
Log in

Compact Unstructured Representations for Evolutionary Design

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results have demonstrated the potential power of Evolutionary methods to find numerical solutions to yet unsolved TOD problems, but those approaches were limited because the complexity of the representation was that of a fixed underlying mesh. Different compact unstructured representations are introduced, the complexity of which is self-adaptive, i.e. is evolved by the algorithm itself. The Voronoi-based representations are variable length lists of alleles that are directly decoded into object shapes, while the IFS representation, based on fractal theory, involves a much more complex morphogenetic process. First results demonstrates that Voronoi-based representations allow one to push further the limits of Evolutionary Topological Optimum Design by actually removing the correlation between the complexity of the representations and that of the discretization. Further comparative results among all these representations on simple test problems seem to indicate that the complex causality in the IFS representation disfavors it compared to the Voronoi-based representations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.R. Koza, Genetic Programming II: Automatic Discovery of Reusable Programs, MIT Press: Massachussetts, 1994.

    Google Scholar 

  2. J.R. Koza et al., Genetic Programming III: Automatic Synthesis of Analog Circuits, MIT Press: Massachussetts, 1999.

    Google Scholar 

  3. F.H. Bennett III, J.R. Koza, M.A. Keane, and D. Andre, “Genetic programming: Biologically inspired computation that exhibits creativity in solving non-trivial problems,” in AISB'99 Symposium on Scientific Creativity, The Society for the Study of Artificial Intelligence and Simulation of Behaviour, 1999, pp. 29–38.

  4. P.J. Bentley, (Ed) Evolutionary Design by Computers, Morgan Kaufman: San Mateo, CA 1999.

    Google Scholar 

  5. P.J. Bentley and S.Kumar, “Threeways to growdesigns: A comparison of embryogenies for an evolutionary design problem,” in Proceedings of the Genetic and Evolutionary Conference, vol. 1. Morgan Kaufmann: San Mateo, CA 1999.

    Google Scholar 

  6. P.D. Surry and N.J. Radcliffe, “Formal algorithms + formal representations = search strategies,” in Proceedings of the 4th Conference on Parallel Problems Solving from Nature, 1996, edited by H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, volume 1141 of LNCS, Springer Verlag: Berlin, pp. 366–375.

    Google Scholar 

  7. P. Bentley, “Exploring component-based representations,” in Adaptive Computing in Design and Manufacture—ACDM'2000, edited by I. Parmee, pp. 161–172, 2000.

  8. J.R. Koza, Genetic Programming: On the Programming of Computers by means of Natural Evolution, MIT Press: Massachusetts, 1992.

    Google Scholar 

  9. W. Banzhaf, P. Nordin, R.E. Keller, and F.D. Francone, Genetic Programming—An Introduction On the Automatic Evolution of Computer Programs and Its Applications, Morgan Kaufmann: San Mateo, CA 1998.

    Google Scholar 

  10. F. Gruau, “Neural network synthesis using cellular encoding and the genetic algorithm,” PhD thesis, Ecole Normale Superieure de Lyon, 1994.

  11. J.R. Koza, M.A. Keane, J. Yu, F.H. Bennett III, and W. Mydlowec, “Evolution of a controller with a free variable using genetic programming,” in EuroGP'2000, edited by R. Poli et al., volume 1802 of LNCS, SpringerVerlag, pp. 91–105, 2000.

  12. C. Kane and M. Schoenauer, “Topological optimum design using genetic algorithms.” Control and Cybernetics, vol. 25, no. 5, pp. 1059–1088, 1996.

    Google Scholar 

  13. C. Kane, “Algorithmes génétiques et Optimisation topologique,” PhD thesis, Université de Paris VI, July 1996.

  14. C. Kane and M. Schoenauer, “Optimisation topologique de formes par algorithmes génétiques,” Revue Franç aise de Mécanique, vol. 4, pp. 237–246, 1997.

    Google Scholar 

  15. P.G. Ciarlet, Mathematical Elasticity, Vol I: Three-Dimensional Elasticity, North-Holland: Amsterdam, 1978.

    Google Scholar 

  16. J. Cea, “Problems of shape optimum design,” in Optimization of Distributed Parameter Structures—Vol. II, edited by E.J. Haug and J. Cea, vol. 50, NATO Series, Series E, 1981, pp. 1005–1088.

  17. S. Garreau, Ph. Guillaume, and M. Masmoudi, “The topological sensitivity for linear isotropic elasticity,” in Proceedings of European Conference on Computational Mechanics, 1999.

  18. M. Bendsoe and N. Kikuchi, “Generating optimal topologies in structural design using a homogenization method,” Computer Methods in Applied Mechanics and Engineering, vol. 71, pp. 197–224, 1988.

    Google Scholar 

  19. 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, vol. 12, no. 6 pp. 839–878, 1993.

    Google Scholar 

  20. G. Allaire, E. Bonnetier, G. Francfort, and F. Jouve, “Shape optimization by the homogenization method,” Nümerische Mathematik, vol. 76, pp. 27–68, 1997.

    Google Scholar 

  21. G. Allaire, Z. Belhachmi, and F. Jouve, “The homogenization method for topology and shape optimization. single and multiple loads case.” European Journal of Finite Elements, vol. 15, no. 5/6, pp. 649–672, 1996.

    Google Scholar 

  22. C. Lin and P. Hajela, “Genetic search strategies in large scale optimization,” in Structures, Structural Dynamics, and Materials Conference, La Jolla, CA, April 1993. AIAA paper #93-1585.

  23. M. Schoenauer and Z.Wu, “Discrete optimal design of structures by genetic algorithms,” in Conf´erence Nationale sur le Calcul de Structures, edited by Bernadou et al., Hermes, pp. 833–842, 1993.

  24. D. Grierson and W. Pak, “Discrete optimal design using a genetic algorithm,” in Topology Design of Structures, edited by M. Bendsoe and C. Soares, NATO Series, pp. 117–133, 1993.

  25. O. Bohnenberger, J. Hesser, and R. Männer, “Automatic design of truss structures using evolutionary algorithms,” in Proceedings of the Second IEEE International Conference on Evolutionary Computation, 1995, edited by D.B. Fogel, vol. 1, IEEE Press, pp. 143–149.

  26. R. Leriche and R.T. Haftka, “Optimization of laminate stacking sequence for buckling load maximization by genetic algorithms,” AIAA Journal, vol. 31, no. 5, pp. 951–970, 1993.

    Google Scholar 

  27. G. Anagnostou, E. Ronquist, and A. Patera, “A computational procedure for part design,” Computer Methods in Applied Mechanics and Engineering, vol. 97, pp. 33–48, 1992.

    Google Scholar 

  28. E. Jensen, “Topological structural design using genetic algorithms,” PhD thesis, Purdue University, Nov. 1992.

  29. C.D. Chapman, K. Saitou, and M.J. Jakiela, “Genetic algorithms as an approach to configuration and topology design,” Journal of Mechanical Design, vol. 116, pp. 1005–1012, 1994.

    Google Scholar 

  30. F. Jouve, Modélisation mathématique de lœil en élasticité nonlinéaire, vol. RMA 26. Masson Paris, 1993.

  31. Z. Michalewicz and M. Schoenauer, “Evolutionary algorithms for constrained parameter optimization problems,” Evolutionary Computation, vol. 4, no. 1, pp. 1–32, 1996.

    Google Scholar 

  32. S. Ben Hamida and M. Schoenauer, “An adaptive algorithm for constrained optimization problems,” in Proceedings of the 6th Conference on Parallel Problems Solving from Nature, 2000, edited by M. Schoenauer et al., LNCS, Springer Verlag, pp. 529–539.

  33. H. Hamda and M. Schoenauer, “Adaptive techniques for evolutionary topological optimum design,” in Evolutionary Design and Manufacture, edited by I. Parmee, 2000, pp. 123–136.

  34. C. Kane and M. Schoenauer, “Genetic operators for twodimensional shape optimization,” in Artificial Evolution, edited by J.-M. Alliot, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, volume 1063 of LNCS, Springer Verlag: Berlin, pp. 355–369, 1995.

    Google Scholar 

  35. R. Cerf, “An asymptotic theory of genetic algorithms,” in Artificial Evolution, edited by J.-M. Alliot, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, vol. 1063 of LNCS, Springer Verlag: Berlin, pp. 37–53, 1996.

    Google Scholar 

  36. D.E. Goldberg, K. Deb, and J.H. Clark, “Genetic algorithms, noise and the sizing of populations,” Complex Systems, vol. 6, pp. 333–362, 1992.

    Google Scholar 

  37. M. Schoenauer, “Representations for evolutionary optimization and identification in structural mechanics,” in Genetic Algorithms in Engineering and Computer Sciences, edited by J. Périaux and G. Winter, John Wiley: New York, pp. 443–464. 1995.

    Google Scholar 

  38. M. Schoenauer, L. Kallel, and F. Jouve, “Mechanical inclusions identification by evolutionary computation,” European Journal of Finite Elements, vol. 5, no. 5/6, pp. 619–648, 1996.

    Google Scholar 

  39. M. Schoenauer, A. Ehinger, and B. Braunschweig, “Nonparametric identification of geological models,” in Proceedings of the Fifth IEEE International Conference on Evolutionary Computation, 1998, edited by D.B. Fogel, IEEE Press: Las Alamitos, CA.

    Google Scholar 

  40. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer Verlag: Berlin, 1985.

    Google Scholar 

  41. H.-P. Schwefel, Numerical Optimization of Computer Models, 2nd edn., John Wiley & Sons: New York, 1981.

    Google Scholar 

  42. L. Kallel and M. Schoenauer, “Alternative random initialization in genetic algorithms,” in Proceedings of the 7th International Conference on Genetic Algorithms, 1997, edited by Th. Bäck, Morgan Kaufmann, pp. 268–275.

  43. M.F. Barnsley, Fractals Everywhere, Academic Press: New York: 1988.

    Google Scholar 

  44. J. Lévy Véhel, “Analyse et synthè se d'objets bi-dimensionnels par desméthodes stochastiques,” PhD thesis, Université de Paris Sud 1988.

  45. R. Vrscay, “Moment and collage methods for the inverse problem of fractal construction with iterated function systems, in Fractal 90 Conference, 1990.

  46. B. Goertzel, “Fractal image compression with the genetic algorithm,” Complexity International, vol. 1, 1994.

  47. D.J. Nettleton and R. Garigliano, “Evolutionary algorithms and a fractal inverse problem,” Biosystems, vol. 33, pp. 221–231, 1994.

    Google Scholar 

  48. E. Lutton, J. Lévy Véhel, G. Cretin, P. Glevarec, and C. Roll, “Mixed IFS: Resolution of the inverse problem using genetic programming,” Complex Systems, vol. 9, pp. 375–398, 1995.

    Google Scholar 

  49. P. Collet, E. Lutton, F. Raynal, and M. Schoenauer, “Polar IFS+ individual GP=Efficient Inverse IFS problem solving,” Genetic Programming and Evolvable Machines, vol. 1, no. 4, pp. 339–361, 2000.

    Google Scholar 

  50. J.R. Koza, “Human-competitive machine intelligence by means of genetic algorithms,” in Festschrift in Honor of John H. Holland, edited by L. Booker, S. Forrest, M. Mitchell, and R. Riolo, Center for the Study of Complex Systems: Ann Arbor, MI, pp. 15–22, 1999.

    Google Scholar 

  51. Ch.R. Dyer, A. Rosenfeld, and H. Samet, “Region representation: Boundary codes from quadtrees,” Commun. Ass. Comput. Mach., vol. 23, no. 3, pp. 171–178, 1980.

    Google Scholar 

  52. T. Schnier and J.S. Gero, “From Mondrian to Frank Lloyd Wright: Transforming evolving representations,” in Adaptive Computing in Design and Manufacture, edited by I. Parmee, Springer Verlag: Berlin, pp. 207–220. 1998.

    Google Scholar 

  53. D.E. Goldberg, B.Korb, and K. Deb, “Messy genetic algorithms: Motivations, analysis and first results,” Complex Systems, vol. 3, pp. 493–530, 1989.

    Google Scholar 

  54. N.J. Radcliffe and P.D. Surry, “Fitness variance of formae and performance prediction,” in Foundations of Genetic Algorithms 3, edited by L.D. Whitley and M.D. Vose, Morgan Kaufmann: San Mateo, CA, pp. 51–72. 1995.

    Google Scholar 

  55. P.J. Angeline, G.M. Saunders, and J.B. Pollack, “An evolutionary algorithm that constructs recurrent neural networks,” IEEE Transactions on Neural Networks, vol. 5, no. 2, pp. 86–91, 1993.

    Google Scholar 

  56. A. Fadda and M. Schoenauer, “Evolutionary chromatographic law identification by recurrent neural nets,” in Proceedings of the 4th Annual Conference on Evolutionary Programming, edited by J.R. McDonnell, R.G. Reynolds, and D.B. Fogel, March 1995, MIT Press, pp. 219–235.

Download references

Author information

Authors and Affiliations

  1. CMAP—UMR CNRS 7641, École Polytechnique, 91128, Palaiseau Cedex, France

    Hatem Hamda, François Jouve & Marc Schoenauer

  2. Projet Fractales—INRIA, Domaine de Voluceau, BP 105, 78153, Le Chesnay Cedex, France

    Evelyne Lutton

  3. LMS—UMR 7649, École Polytechnique, 91128, Palaiseau Cedex, France

    MichÈle Sebag

Authors
  1. Hatem Hamda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. François Jouve
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Evelyne Lutton
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marc Schoenauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. MichÈle Sebag
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hamda, H., Jouve, F., Lutton, E. et al. Compact Unstructured Representations for Evolutionary Design. Applied Intelligence 16, 139–155 (2002). https://doi.org/10.1023/A:1013666503249

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013666503249

Search

Navigation