835 search results - page 10 / 167 » Dynamic populations in genetic algorithms |
GECCO
1999
Springer
15 years 1 months ago
1999
Springer
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 ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
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 ...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. This paper introduces a new technique called adaptive elitistpopulation search method for allowing unimodal function optimization methods to be extended to efficiently lo...
103
click to vote
CLOUDCOM
2010
Springer
14 years 7 months ago
2010
Springer
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...
74
Voted
TEC
2002
14 years 9 months ago
2002
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 ...