Sciweavers

835 search results - page 29 / 167
» Dynamic populations in genetic algorithms
Sort
View
104
Voted
CEC
2005
IEEE
15 years 6 months ago
Complexity transitions in evolutionary algorithms: evaluating the impact of the initial population
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
113
Voted
AAMAS
2002
Springer
15 years 9 days ago
Adapting Populations of Agents
We control a population of interacting software agents. The agents have a strategy, and receive a payoff for executing that strategy. Unsuccessful agents become extinct. We investi...
Philippe De Wilde, Maria Chli, Luís Correia...
ICEC
1996
101views more  ICEC 1996»
15 years 1 months ago
A Genetic Algorithm-Based Controller for Decentralized Multi-Agent Robotic Systems
-- In this paper the results of evolution on the task performance of a robot colony are discussed. The cognitive architecture of individual robots of a colony are modified, using g...
Arvin Agah, George A. Bekey
108
Voted
GECCO
2003
Springer
15 years 5 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 5 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel