Genetic Algorithms
Genetic
Algorithms (GAs) are a search technique inspired by Genetics and Evolution.
GAs have been used extensively in order to solve a wide range of optimization
problems. An excellent description of GAs can be found here
or here.
A presentation on the application of GAs to a network design problem (ring
design) can be found here.
GAs have been combined with Simulated Annealing and
Tabu Search in order to provide more powerful and
flexible search algorithms. Useful references to GAs can be found by following
these links and the links contained within them:
Publications
-
An Introduction
to Genetic Algorithms
-
Evolutionary
Algorithms in Engineering Applications
-
Adaptation
in Natural and Artificial Systems
-
Emergent
Computing Methods in Engineering Design
Links to Evolutionary Computation (EC) material
(includes GAs)
-
General collection of links on
GAs
-
Illinois Genetic Algorithms
Laboratory (IlliGAL)
-
Carleton
School of Computer Science links on Evolutionary Computation
-
Nova Genetica by David
Molnar
-
The Genetic Algorithm Archive
maintained by the US Navy
-
EvolutioNary
COmputationREpository network
-
EVONET The European
Network of Excellence in Evolutionary Computing
-
Artificial
Evolution Archive
Groups involved in Evolutionary Computation (includes
GAs)
-
University
of Sheffield Evolutionary Computation Projects
-
University of East Anglia
Mathematical Algorithms Group (MAG)
-
UMich Genetic Algorithm Research Group
(MSU GARAGe)
-
Evolutionary Computing
Group at UWE, Bristol
-
Plymouth Engineering
Design Centre
-
Evolutionary Computation
Research Group at Napier University, Edinburgh
-
Evolutionary
and Adaptive Systems (EASy) at Sussex University
Demonstration applets
-
Gamelan
archive of Java applets
This page is in its infancy,
and will ultimately contain many links to applications related to EC.