期刊
出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.proeng.2017.01.467
关键词
Ant Colony Optimisation; Evolutionary Algorithm; Truss Structure; Topology Optimisation; Size Optimisation
Over the last decade, researchers have proposed several ant colony optimisation algorithms to solve combinatorial problems. Ant Colony Optimisation (ACO) was introduced by Dorigo et al. in the early 1990s and is based on the behaviour of natural ant colonies, in particular the foraging behaviour of real ant species. The indirect communication of real ants in the colony uses pheromone trail lying on the path to find the shortest trail between their food source and the nest. Recently, Evolutionary ACO algorithms have been proposed to solve truss optimisation problems (EACO algorithms). This algorithm can solve truss size and topology problems, which makes EACO very attractive to solve non-combinatorial optimisation problems. Computational tests are described to show the effectiveness of the EACO. (C) 2017 The Authors. Published by Elsevier Ltd.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据