An ant colony algorithm applied to lay-up optimization of laminated composite plates

Ant colony optimization (ACO) is a class of heuristic algorithms proposed to solve optimization problems. The idea was inspired by the behavior of real ants, related to their ability to find the shortest path between the nest and the food source. ACO has been applied successfully to different kinds...

Full description

Saved in:
Bibliographic Details
Published in:Latin American journal of solids and structures Vol. 10; no. 3; pp. 491 - 504
Main Authors: Koide, Rubem Matimoto, França, Gustavo von Zeska de, Luersen, Marco Antônio
Format: Journal Article
Language:English
Published: Associação Brasileira de Ciências Mecânicas 01-05-2013
Marcílio Alves
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Ant colony optimization (ACO) is a class of heuristic algorithms proposed to solve optimization problems. The idea was inspired by the behavior of real ants, related to their ability to find the shortest path between the nest and the food source. ACO has been applied successfully to different kinds of problems. So, this manuscript describes the development and application of an ACO algorithm to find the optimal stacking sequence of laminated composite plates. The developed ACO algorithm was evaluated on four examples for symmetric and balanced lay-up. The results of the first three cases, in which the classical lamination theory was used to obtain the structural response of rectangular plates, were compared to those obtained from the literature using genetic algorithms (GA) and other ACO algorithm. The fourth example investigates the maximization of fundamental frequencies of rectangular plates with central holes, where the structural response was obtained by finite element analysis, showing that this optimization technique may be successfully applied to a broad class of stacking sequence problems for laminated composites.
ISSN:1679-7825
1679-7825
DOI:10.1590/S1679-78252013000300003