Geometric Representations For Conceptual Design Using Evolutionary Algorithms

Created by W.Langdon from gp-bibliography.bib Revision:1.4192

  author =       "David Shaw",
  title =        "Geometric Representations For Conceptual Design Using
                 Evolutionary Algorithms",
  school =       "Cardiff School of Engineering and School of Computer
                 Science, Cardiff University",
  year =         "2007",
  address =      "UK",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "",
  size =         "128 pages",
  abstract =     "The aim of this thesis is to investigate how some
                 civil engineering design problems, in particular
                 structures, can be represented using evolutionary
                 algorithms (EA) and contains two, independent
                 experimental chapters on building layout design and
                 geometric dome design (an introduction to EAs and
                 design is also provided).

                 Civil engineering design problems are typically
                 approached using traditional techniques i.e.
                 deterministic algorithms, rather than via stochastic
                 search such as EAs. However EAs are adept at exploring
                 fragmented and complex search spaces, such as those
                 found in design, but do require potential solutions to
                 have a representation amenable to evolutionary
                 operators. Four canonical representations have been
                 proposed including: strings (generally used for
                 parameter based problems), voxels (shape discovery),
                 trees and graphs (skeletal structures).

                 Several authors have proposed design algorithms for the
                 conceptual layout design of commercial office buildings
                 but all are limited to buildings with rectangular floor
                 plans. This thesis presents an evolutionary algorithm
                 based methodology capable of representing buildings
                 with orthogonal boundaries and atria by using a
                 3-section string with real encoding, which ensures the
                 initialisation and evolutionary operations are not too
                 disruptive on column alignments encoded via the genome.
                 In order to handle orthogonal layouts polygon
                 partitioning techniques are used to decompose them into
                 rectangular sections, which can be solved individually.
                 However to prevent the layout becoming too
                 discontinuous, an adjacency graph is proposed which
                 ensures column line continuity throughout the

                 Dome geometric layout design is difficult, because
                 every joint and member must be located on the external
                 surface and not impinge on the internal void. This
                 thesis describes a string-based representation capable
                 of designing directly in 3D using surface area and
                 enclosed volume as the major search parameters. The
                 representation encodes support and joint positions,
                 which are converted into a dome by constructing its
                 corresponding convex hull. Once constructed the hull's
                 edges become the structural members and its vertices
                 the joints. This avoids many of the problems
                 experienced by the previous approach, which suffers
                 when restrictive constraints such as the requirement to
                 maintain 1/8th symmetry are removed.",
  notes =        "

                 Cited by doi:10.1016/j.compstruc.2008.04.009",

Genetic Programming entries for Dave Shaw