1991
DOI: 10.1109/43.75636
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial optimization by stochastic evolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

1995
1995
2017
2017

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 85 publications
(26 citation statements)
references
References 27 publications
0
26
0
Order By: Relevance
“…Although SimE was used for this paper, any stochastic optimization algorithm (e.g. Genetic Algorithm [18], Tabu Search [16,17], Simulated Annealing [34], Stochastic Evolution [37,38], Ant Colony Optimization [7,10], etc.) can be used instead.…”
Section: Fuzzy Simulated Evolution Algorithm For Dlan Topology Designmentioning
confidence: 99%
“…Although SimE was used for this paper, any stochastic optimization algorithm (e.g. Genetic Algorithm [18], Tabu Search [16,17], Simulated Annealing [34], Stochastic Evolution [37,38], Ant Colony Optimization [7,10], etc.) can be used instead.…”
Section: Fuzzy Simulated Evolution Algorithm For Dlan Topology Designmentioning
confidence: 99%
“…These approaches tend to suffer from an excessive computational time with the increase of variables. To overcome this difficulty, modern techniques such as simulated annealing (Cerny, 1985;Kirkpatrick et al, 1983), stochastic evolution (Saab and Rao, 1991), genetic algorithms (Goldberg, 1989) and Tabu search (Rajan and Mohan, 2004) have been proposed as alternatives where the problem size precludes traditional techniques. These techniques are completely distinct from classical programming and trial-and-error heuristic methods.…”
Section: Introductionmentioning
confidence: 99%
“…If R is too small, the algorithm will not have enough time to improve the initial solution, and if R is too large, the algorithm may waste too much time during the later generations. Experimental studies indicate that a value of R between 10 and 20 gives good results [6]. Finally, the variable ρ is a counter used to decide when to stop the search.…”
Section: Stochastic Evolution (Stoce)mentioning
confidence: 99%
“…Stochastic evolution (StocE) [6] and Simulated Evolution (SimE) [5] are evolutionary iterative search algorithms, similar to other well known iterative non-deterministic heuristics such as Simulated Annealing (SA), Genetic Algorithms (GA) and Tabu Search (TS) [8]. The two algorithms are inspired by the alleged behavior of biological processes, however, they differ fundamentally in how the principles of evolution are applied.…”
Section: Introductionmentioning
confidence: 99%