Nature's way of optimizing
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 1059167 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- Combining simulated annealing with local search heuristics
- Equation of state calculations by fast computing machines
- Extremal optimization of graph partitioning at the percolation threshold
- Future paths for integer programming and links to artificial intelligence
- Genetic algorithm and graph partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by simulated annealing
- Recent directions in netlist partitioning: a survey
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(29)- The computing of the optimal power consumption for semi-track air-cushion vehicle using hybrid generalized extremal optimization
- Next nearest neighbour Ising models on random graphs
- The peculiar phase structure of random graph bisection
- Optimization and self-organized criticality in a magnetic system
- Nonlinear optimization simplified by hypersurface deformation.
- Positive role of glassy dynamics in finite-time optimization by threshold algorithms
- Hysteretic optimization for the traveling salesman problem
- A HETEROSYNAPTIC LEARNING RULE FOR NEURAL NETWORKS
- Studies on controllability of directed networks with extremal optimization
- Population extremal optimization-based extended distributed model predictive load frequency control of multi-area interconnected power systems
- Computational Science – ICCS 2005
- Replica symmetry of the minimum matching
- The mean field traveling salesman and related problems
- Development of hybrid evolutionary algorithms for production scheduling of hot strip mill
- Multiobjective extremal optimization with applications to engineering design
- Adaptive extremal optimization by detrended fluctuation analysis
- Memetic algorithms-based neural network learning for basic oxygen furnace endpoint prediction
- Design of PID controller based on a self-adaptive state-space predictive functional control using extremal optimization method
- NONLINEAR TIME SERIES PREDICTION BASED ON A POWER-LAW NOISE MODEL
- Large-scale parallelism for constraint-based local search: the costas array case study
- An improved real-coded population-based extremal optimization method for continuous unconstrained optimization problems
- An emergent computation approach to the problem of polygon layout with performance constraints
- Faster Monte Carlo simulations at low temperatures. The waiting time method
- Extremal optimization of graph partitioning at the percolation threshold
- scientific article; zbMATH DE number 2151246 (Why is no real title available?)
- scientific article; zbMATH DE number 2159026 (Why is no real title available?)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity
- A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization
- The ``molecular traveling salesman
This page was built for publication: Nature's way of optimizing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575193)
