Sciweavers

159 search results - page 11 / 32
» Adaptive Genetic Algorithm with Mutation and Crossover Matri...
Sort
View
GECCO
2004
Springer
126views Optimization» more  GECCO 2004»
14 years 28 days ago
A Gene Based Adaptive Mutation Strategy for Genetic Algorithms
In this study, a new mechanism that adapts the mutation rate for each locus on the chromosomes, based on feedback obtained from the current population is proposed. Through tests us...
Sima Uyar, Sanem Sariel, Gülsen Eryigit
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 11 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
CEC
2008
IEEE
14 years 2 months ago
A Quantum-inspired Genetic Algorithm for data clustering
—The conventional K-Means clustering algorithm must know the number of clusters in advance and the clustering result is sensitive to the selection of the initial cluster centroid...
Jing Xiao, YuPing Yan, Ying Lin, Ling Yuan, Jun Zh...
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 2 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen
TEC
2002
117views more  TEC 2002»
13 years 7 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna