Nature's way of optimizing (Q1575193)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nature's way of optimizing |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nature's way of optimizing |
scientific article |
Statements
Nature's way of optimizing (English)
0 references
21 August 2000
0 references
We propose a general-purpose method for finding high-quality solutions to hard optimization problems, inspired by self-organizing processes often found in nature. The method, called extremal optimization, successively eliminates extremely undesirable components of sub-optimal solutions. Drawing upon models used to simulate far-from-equilibrium dynamics, it complements approximation methods inspired by equilibrium statistical physics, such as simulated annealing. With only one adjustable parameter, its performance proves competitive with, and often superior to, more elaborate stochastic optimization procedures. We demonstrate it here on two classic hard optimization problems: graph partitioning and the traveling salesman problem.
0 references
combinatorial optimization
0 references
heuristics
0 references
local search
0 references
graph partitioning
0 references
traveling salesman problem
0 references
self-organized criticality
0 references
0 references
0 references