Sciweavers

2174 search results - page 260 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
AI
2003
Springer
15 years 11 months ago
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
Alena Shmygelska, Holger H. Hoos
AI
1998
Springer
15 years 10 months ago
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
Jean Berger, Martin Salois, Regent Begin
ACRI
2006
Springer
15 years 8 months ago
From Cells to Islands: An Unified Model of Cellular Parallel Genetic Algorithms
Abstract. This paper presents the Anisotropic selection scheme for cellular Genetic Algorithms (cGA). This new scheme allows to enhance diversity and to control the selective press...
David Simoncini, Philippe Collard, Sébastie...
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
16 years 1 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
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
16 years 20 days ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith