2007
DOI: 10.1002/nme.2088
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic selective pressure using hybrid evolutionary and ant system strategies for structural optimization

Abstract: SUMMARYGenetic algorithms have already been applied to various fields of engineering problems as a general optimization tool in charge of expensive sampling of the coded design space. In order to reduce such a computational cost in practice, application of evolutionary strategies is growing rapidly in the adaptive use of problem-specific information. This paper proposes a hybrid strategy to utilize a cooperative dynamic memory of more competitive solutions combining indirect information share in ant systems wi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
6
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 24 publications
0
6
0
Order By: Relevance
“…The adaptive method (b) was considered more effective in solving complex problems, as a feedback from the optimization process is set to adjust parameter values during optimization progresses [26,54]. The aforementioned technique was adopted by many researchers to improve algorithms' performance, as in [30,49,[55][56][57], however none of these (and others) develop a self-adaptive technique that is sensitive to optimality achievement during evaluation progress [31].…”
Section: Self-adaptive Mechanism and Formulaementioning
confidence: 99%
“…The adaptive method (b) was considered more effective in solving complex problems, as a feedback from the optimization process is set to adjust parameter values during optimization progresses [26,54]. The aforementioned technique was adopted by many researchers to improve algorithms' performance, as in [30,49,[55][56][57], however none of these (and others) develop a self-adaptive technique that is sensitive to optimality achievement during evaluation progress [31].…”
Section: Self-adaptive Mechanism and Formulaementioning
confidence: 99%
“…Among these algorithms, GAs have been broadly applied to solve various structural optimization problems, Kaveh and Kalatjari [2][3][4], Kaveh and Abditehrani [5], Kaveh and Rahami [6,7], Adeli and Cheng [8], Rajeev and Krishnamoorthy [9,10], Koumousis and Georgious [11], Hajela and Lee [12], Adeli and Kumar [13], Wu and Chow [14,15], Soh and Yang [16], Camp et al [17], Shrestha and Ghaboussi [18], Erbatur et al [19], and Sarma and Adeli [20] among many others. Ant Colony Optimization (ACO) is a new approach for structural design inspired by natural phenomena applied to different optimization problems by Kaveh [21][22][23], and Camp and Bichon [24].…”
Section: Introductionmentioning
confidence: 99%
“…HPSACO utilizes a particle swarm optimization with a passive congregation algorithm as a global search, and the idea of ant colony approach worked as a local search. However, it is known that the PSO algorithm had difficulties in controlling the balance between exploration (global investigation of the search place) and exploitation (the fine search around a local optimum) [36].Ant colony optimization (ACO) was first proposed by Dorigo [37, 38] as a multi-agent approach to solve difficult combinatorial optimization problems and it has been applied to various engineering problems in recent years [39][40][41][42][43][44]. In the discrete HPSACO, agents are allowed to select discrete values from the permissible list of cross sections.…”
mentioning
confidence: 99%
“…Ant colony optimization (ACO) was first proposed by Dorigo [37, 38] as a multi-agent approach to solve difficult combinatorial optimization problems and it has been applied to various engineering problems in recent years [39][40][41][42][43][44]. ACO Hybrid Algorithm of Harmony Search, Particle Swarm and Ant Colony 161 was inspired by the observation of real ant colonies.…”
mentioning
confidence: 99%