Name
Abstract | ||
|---|---|---|
Genetic algorithms (GAs) have such potentials for realizing emergent searches that local search techniques, such as simulated annealings, and parallel local search techniques, like other evolutionary computation such as evolution strategies and evolutionary programmings, do not have. Crossover operators bring these potentials because they can emerge their neighborhood structures as populations evolve. The paper presents a realization of emergent searches by GAs. First, we show difficulties for local search techniques to solve double circle TSPs, and discuss how emergent searches can overcome such difficulties. Second, we propose guidelines to achieve emergent searches by GAs; the characteristics preserving encodings/crossovers design and the diversity maintaining generation alternation models design. According to these guidelines, we actually realize GAs to solve double circle TSPs |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/ICEC.1996.542656 | International Conference on Evolutionary Computation |
Keywords | Field | DocType |
genetic algorithms,search problems,travelling salesman problems,crossover operators,double circle TSPs,emergent searches,encodings/crossovers design,generation alternation models design,genetic algorithms,local search techniques,neighborhood structures,subgour exchange crossover,travelling salesman problems | Simulated annealing,Crossover,Evolutionary computation,Algorithm,Operator (computer programming),Local search (optimization),Synthetic aperture sonar,Genetic algorithm,Mathematics,Double Circle | Conference |
ISBN | Citations | PageRank |
0-7803-2902-3 | 3 | 0.50 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masayuki Yamamura | 1 | 242 | 37.62 |
| Isao Ono | 2 | 298 | 35.62 |
| Shigenobu Kobayashi | 3 | 791 | 98.15 |