TY - CHAP
T1 - Evolution of contours for topology optimization
AU - Avigad, Gideon
AU - Matalon Eisenstadt, Erella
AU - Salomon, Shaul
AU - Gadelha Guimar, Frederico
PY - 2013
Y1 - 2013
N2 - Topology optimization is used to find a preliminary structural configuration that meets a predefined criterion. It involves optimizing both the external boundary and the distribution of the internal material within a structure. Usually, counters are used a posteriori to the topology optimization to further adapt the shape of the topology according to manufacturing needs. Here we suggest optimizing topologies by evolving counters. We consider both outer and inner counters to allow for holes in the structure. Due to the difficulty of defining a reliable measure for the differences among shapes, little research attention has been focused on simultaneously finding diverse sets of optimal topologies. Here, niching is implemented within a suggested evolutionary algorithm in order to find diverse topologies. The niching is then embedded within the algorithm through the use of our recently introduced partitioning algorithm. For this algorithm to be used, the topologies are represented as functions. Two examples are given to demonstrate the approach. These examples show that the algorithm evolves a set of diverse optimal topologies.
AB - Topology optimization is used to find a preliminary structural configuration that meets a predefined criterion. It involves optimizing both the external boundary and the distribution of the internal material within a structure. Usually, counters are used a posteriori to the topology optimization to further adapt the shape of the topology according to manufacturing needs. Here we suggest optimizing topologies by evolving counters. We consider both outer and inner counters to allow for holes in the structure. Due to the difficulty of defining a reliable measure for the differences among shapes, little research attention has been focused on simultaneously finding diverse sets of optimal topologies. Here, niching is implemented within a suggested evolutionary algorithm in order to find diverse topologies. The niching is then embedded within the algorithm through the use of our recently introduced partitioning algorithm. For this algorithm to be used, the topologies are represented as functions. Two examples are given to demonstrate the approach. These examples show that the algorithm evolves a set of diverse optimal topologies.
UR - http://www.scopus.com/inward/record.url?scp=84872557030&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-31519-0_26
DO - 10.1007/978-3-642-31519-0_26
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???
AN - SCOPUS:84872557030
SN - 9783642315183
T3 - Advances in Intelligent Systems and Computing
SP - 397
EP - 412
BT - EVOLVE A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II
PB - Springer Verlag
ER -