Analysis and benchmarking of meta-heuristic techniques for lay-up optimization

The analysis and benchmarking of three meta-heuristic algorithms to determine laminate stacking sequences is presented. The benchmarking is undertaken for a simply supported composite laminate subject to strength and buckling constraints. A genetic algorithm, ant colony and particle swarm optimizati...

Full description

Saved in:
Bibliographic Details
Published inComputers & structures Vol. 88; no. 5; pp. 272 - 282
Main Authors Bloomfield, Mark W., Herencia, J. Enrique, Weaver, Paul M.
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier Ltd 01.03.2010
Elsevier
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The analysis and benchmarking of three meta-heuristic algorithms to determine laminate stacking sequences is presented. The benchmarking is undertaken for a simply supported composite laminate subject to strength and buckling constraints. A genetic algorithm, ant colony and particle swarm optimization are considered. It is shown that for inherently discrete sets of ply orientations, ant colony optimization outperforms the other algorithms. For continuous problems, a particle swarm may be the most appropriate. It is further shown that selection of an appropriate algorithm may be indeed problem dependent.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0045-7949
1879-2243
DOI:10.1016/j.compstruc.2009.10.007