2012
DOI: 10.1016/j.asoc.2011.11.018
|View full text |Cite
|
Sign up to set email alerts
|

Design optimization with chaos embedded great deluge algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
26
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 78 publications
(27 citation statements)
references
References 54 publications
1
26
0
Order By: Relevance
“…is the search space of decision variables; S1(·) is a chaotic sequence-like iterative chaotic map with infinite collapses(ICMIC) [27]:…”
Section: Proposed Caro Techniquementioning
confidence: 99%
See 1 more Smart Citation
“…is the search space of decision variables; S1(·) is a chaotic sequence-like iterative chaotic map with infinite collapses(ICMIC) [27]:…”
Section: Proposed Caro Techniquementioning
confidence: 99%
“…Due to non-repetitive nature of chaos, it can carry out overall searches at higher speeds than stochastic ergodic searches that is probabilistic in nature [20]. The combination of optimization techniques and chaotic sequences are important issues in nonlinear science and has attracted increased interests from various fields, such as chaotic particle swarm optimization [20,21], chaotic genetic algorithms [22], chaotic ant swarm optimization [23,24], chaotic bee colony algorithms [25], chaotic harmony search algorithm [26], chaos embedded great deluge algorithm [27]. The choice of chaotic sequence is justified theoretically by their spread-spectrum characteristic and ergodic properties.…”
Section: Introductionmentioning
confidence: 99%
“…Although GDA was originally applied to the Traveler Salesman Problem, most of the research papers that use this method are in the area of scheduling problems and especially course and examination timetabling [18,19]. GDA has also been applied to other optimization problems like channel assignment in cellular communications [20], preventive maintenance optimization for multi−state systems [21], constrained mechanical optimization [22] and others. GDA is less common than other trajectory search meta−heuristics but its simplicity and single parameter tuning makes it a good candidate for several optimization problems that occur in practice.…”
Section: Genetic Algorithm and Great Delugementioning
confidence: 99%
“…The Decay Rate parameter DR is computed for each individual of the population by dividing the initial fitness value of the individual F(S) by the number of iterations ITER that GDA is allowed to perform. A new solution S' is generated from S using neighborhood functions similar to those described in [22]. Thus, for a variable referring to the voltage applied to a certain position i the new value V i * is computed based on the existing value V i and the following equation:…”
Section: Genetic Algorithm and Great Delugementioning
confidence: 99%
“…According to parameter system behaves chaotic or not chaotic [31,32]. x is the initial seed and is control parameter.…”
Section: Chaotic Mapsmentioning
confidence: 99%