2007
DOI: 10.1108/02644400710734990
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid ant strategy and genetic algorithm to tune the population size for efficient structural optimization

Abstract: PurposeAlthough genetic algorithm (GA) has already been extended to various types of engineering problems, tuning its parameters is still an interesting field of interest. Some recent works have addressed attempts requiring several GA runs, while more interesting approaches aim to obtain proper estimate of a tuned parameter during any run of genetic search. This paper seeks to address this issue.Design/methodology/approachIn this paper, a competitive frequency‐based methodology is proposed to explore the least… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 29 publications
0
11
0
Order By: Relevance
“…Moreover, as aforementioned, the larger the population size, the better the response quality will be. Due to this fact and to results provided by Kaveh and Shahrouzi (2007), Ma and Zhang (2008) and Pinho et al (2012), the researchers opted to increase the initial population calculated by Reeves and Rowe (2002) by 50% in each new algorithm generation.…”
Section: Proposed Optimization Methods Necessary Adaptations For the Omentioning
confidence: 99%
“…Moreover, as aforementioned, the larger the population size, the better the response quality will be. Due to this fact and to results provided by Kaveh and Shahrouzi (2007), Ma and Zhang (2008) and Pinho et al (2012), the researchers opted to increase the initial population calculated by Reeves and Rowe (2002) by 50% in each new algorithm generation.…”
Section: Proposed Optimization Methods Necessary Adaptations For the Omentioning
confidence: 99%
“…The width of such a portion is dominated by the number of sampling ants, N , while its depth is affected by the pheromone deposit packet, . In the sampling process offered by the authors [33,34], at every generation of the evolutionary search, N ants sample N individuals of the current population that are fitter than the others. These sampled solution states are then copied to the colony of more frequent successive individuals.…”
Section: Dynamic Sampling Of the Best Generative Individuals Using Anmentioning
confidence: 99%
“…As new islands are added to and old ones gradually are omitted from the current population as the search window, fitter representatives of them will compete with the current elite ones alternatively. Such a process is called alternate appearance of competitive individuals [10,33]. Despite GAs, ant strategies use an indirect type of information share between individual solution trials.…”
Section: Dynamic Sampling Of the Best Generative Individuals Using Anmentioning
confidence: 99%
“…Lately, a Modified Ant Search [18] algorithm was proposed to improve the performance of the AS algorithm by using an Elitist ants approach with dynamic enter/exit strategies between the exploration and exploitation phases. Kaveh and Shahrouzi [19,20] used a hybrid genetic algorithm (GA) and Ant Colony Optimization (ACO) approach where the latter was used to fine tune the parameters of the GA and applied the approach to structural optimization problems. Instead of fixing the population size for the GA, the proposed algorithm starts with a relatively small population.…”
Section: Introductionmentioning
confidence: 99%