Nature's algorithms [genetic algorithms]
Authors:
- R. SinhaRSR. Sinha
- 1 January 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Potentials
- Vol. 20 (2) , 21-24
Abstract
Combinatorial optimization problems typically require every possible solution to be evaluated to ensure finding the optimal solution. Since such exhaustive searches are often impractical, there is now a vast body of heuristic algorithms for them. Among the algorithms are those based on metaphors borrowed from other areas of science. The idea is that key elements of physical processes can be used abstractly to form the basis of an optimization algorithm. This article presents a broad overview of several metaphor-based algorithms, including the widely-used genetic and simulated annealing algorithms.Keywords
This publication has 3 references indexed in Scilit:
- Simulated N-Body: New Particle Physics-Based Heuristics for a Euclidean Location-Allocation ProblemJournal of Heuristics, 2001
- Molecular Computation of Solutions to Combinatorial ProblemsScience, 1994
- A microeconomic approach to optimal resource allocation in distributed computer systemsIEEE Transactions on Computers, 1989