Sciweavers

835 search results - page 10 / 167
» Dynamic populations in genetic algorithms
Sort
View
GECCO
1999
Springer
115views Optimization» more  GECCO 1999»
15 years 10 months ago
A Diversity Study in Genetic Algorithms for Job Shop Scheduling Problems
This paper deals with the study of population diversity in Genetic Algorithms for Job Shop Scheduling Problems. A definition of population diversity at the phenotype level and a ...
Carlos A. Brizuela, Nobuo Sannomiya
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
15 years 11 months ago
Adaptive sizing of populations and number of islands in distributed genetic algorithms
Deciding the appropriate population size and number of islands for distributed island-model genetic algorithms is often critical to the algorithm’s success. This paper outlines ...
Johan Berntsson, Maolin Tang
GECCO
2003
Springer
155views Optimization» more  GECCO 2003»
15 years 11 months ago
Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function Optimization
Abstract. This paper introduces a new technique called adaptive elitistpopulation search method for allowing unimodal function optimization methods to be extended to efficiently lo...
Kwong-Sak Leung, Yong Liang
CLOUDCOM
2010
Springer
15 years 3 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Di-Wei Huang, Jimmy Lin
TEC
2002
117views more  TEC 2002»
15 years 5 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