TY - JOUR

T1 - Numerical experiments on size optimization of truss structures by use of Genetic Algorithm (an approach for optimization using fully stressed design and Genetic Algorithm)

AU - Asayama, M.

AU - Hasegawa, H.

AU - Kawamo, K.

PY - 1996

Y1 - 1996

N2 - Genetic Algorithm (GA) is known to be excellent in searching globally optimal solutions, though it requires a large population size of the chromosome and a large number of generation. Some studies are carried out in order to reduce the population size and the number of generations to obtain the solutions. For the purpose, the Authors try to discuss size optimization of truss structures whose members are discretized in the cross-sectional areas by using GA. The structure is coded by a binary string consisting of substrings, which represent the cross-sectional areas of the members and whose numbers are equal to the numbers of the members. Two types of GA models are adopted. In one type the operations are applied to all the substrings simultaneously during a generation. On the other hand, in the other the operations are applied to each substring, one at time. Various kinds of GA strategies, such as simple GA, elite strategy, hybrid strategy combined GA with fully stressed design, etc, are tested in numerical experiments. From their results the authors confirm that the hybrid strategy are most efficient and stable for searching globally optimal solutions.

AB - Genetic Algorithm (GA) is known to be excellent in searching globally optimal solutions, though it requires a large population size of the chromosome and a large number of generation. Some studies are carried out in order to reduce the population size and the number of generations to obtain the solutions. For the purpose, the Authors try to discuss size optimization of truss structures whose members are discretized in the cross-sectional areas by using GA. The structure is coded by a binary string consisting of substrings, which represent the cross-sectional areas of the members and whose numbers are equal to the numbers of the members. Two types of GA models are adopted. In one type the operations are applied to all the substrings simultaneously during a generation. On the other hand, in the other the operations are applied to each substring, one at time. Various kinds of GA strategies, such as simple GA, elite strategy, hybrid strategy combined GA with fully stressed design, etc, are tested in numerical experiments. From their results the authors confirm that the hybrid strategy are most efficient and stable for searching globally optimal solutions.

UR - http://www.scopus.com/inward/record.url?scp=0030143698&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030143698&partnerID=8YFLogxK

U2 - 10.1299/kikaia.62.1234

DO - 10.1299/kikaia.62.1234

M3 - Article

AN - SCOPUS:0030143698

SN - 0387-5008

VL - 62

SP - 1234

EP - 1241

JO - Nihon Kikai Gakkai Ronbunshu, A Hen/Transactions of the Japan Society of Mechanical Engineers, Part A

JF - Nihon Kikai Gakkai Ronbunshu, A Hen/Transactions of the Japan Society of Mechanical Engineers, Part A

IS - 597

ER -