Show simple item record

contributor authorHojjat Adeli
contributor authorSanjay Kumar
date accessioned2017-05-08T21:15:51Z
date available2017-05-08T21:15:51Z
date copyrightJuly 1995
date issued1995
identifier other%28asce%290893-1321%281995%298%3A3%28156%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/44815
description abstractParallel algorithms for optimization of structures reported in the literature have been restricted to shared-memory multiprocessors. This paper presents a distributed genetic algorithm for optimization of large structures on a cluster of workstations connected via a local area network (LAN). The selection of genetic algorithm is based on its adaptability to a high degree of parallelism. Two different approaches are used to transform the constrained structural optimization problem to an unconstrained optimization problem: a penalty-function method and augmented Lagrangian approach. For the solution of the resulting simultaneous linear equations the iterative preconditioned conjugate gradient (PCG) method is used because of its low memory requirement. A dynamic load-balancing mechanism is developed to account for the unpredictable multiuser, multasking environment of a networked cluster of workstations, heterogeneity of machines, and indeterminate nature of the interative PCG equation solver. The algorithm has been applied to optimization of a large space steel structure subjected to vertical and horizontal loads and the constraints of the AISC ASD specifications.
publisherAmerican Society of Civil Engineers
titleDistributed Genetic Algorithm for Structural Optimization
typeJournal Paper
journal volume8
journal issue3
journal titleJournal of Aerospace Engineering
identifier doi10.1061/(ASCE)0893-1321(1995)8:3(156)
treeJournal of Aerospace Engineering:;1995:;Volume ( 008 ):;issue: 003
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record