scispace - formally typeset
Search or ask a question
Topic

Extremal optimization

About: Extremal optimization is a research topic. Over the lifetime, 1168 publications have been published within this topic receiving 104943 citations.


Papers
More filters
Journal ArticleDOI
11 Mar 2014
TL;DR: A new treatment is presented for land use planning problems by means of extremal optimization in conjunction to cell-based neighborhood local search, which yields significant compactness values as emergent results.
Abstract: A new treatment is presented for land use planning problems by means of extremal optimization in conjunction to cell-based neighborhood local search. Extremal optimization, inspired by self-organized critical models of evolution has been applied mainly to the solution of classical combinatorial optimization problems. Cell-based local search has been employed by the author elsewhere in problems of spatial resource allocation in combination with genetic algorithms and simulated annealing. In this paper it complements extremal optimization in order to enhance its capacity for a spatial optimization problem. The hybrid method thus formed is compared to methods of the literature on a specific characteristic problem. It yields better results both in terms of objective function values and in terms of compactness. The latter is an important quantity for spatial planning. The present treatment yields significant compactness values as emergent results.

1 citations

Book ChapterDOI
01 Jan 1993
TL;DR: A large number of papers have been devoted to combinatorial optimization problems and a traditional approach of Operational Research has been used (Lawler et al. 1985) as mentioned in this paper.
Abstract: This paper deals with the NP-complete combinatorial optimization problems. A large number of papers has been devoted to them. A traditional approach of Operational Research has been used (Lawler et al. 1985). Kirkpatrick et al. (1983) used Simulated Annealing. Hopfield and Tank (1985) applied a neural networks for finding suboptimal solution for TSP. In recent years interest has raised to apply evolutionary algorithms to combinatorial optimization problems (Holland 1975; Brady 1985).

1 citations

Journal ArticleDOI
TL;DR: In this paper, a set of nonlinear integral equations is derived and the imaging problem is reformulated into an optimization one, and two evolutionary algorithms are used to solve the inverse scattering problem.
Abstract: In this paper, the solution of the inverse scattering problem for determining the shape and location of perfectly conducting scatterers by making use of electromagnetic scattered fields is presented. Based on the boundary condition and the measured scattered field, a set of nonlinear integral equations is derived and the imaging problem is reformulated into an optimization one. Then, two evolutionary algorithms are used to solve the inverse scattering problem. To further clarify, our contribution is to test two well-known algorithms in the literature to the problem of microwave imaging. The hybrid approaches combine the standard particle swarm optimization (PSO) with the ideas of the simulated annealing and extremal optimization algorithms, respectively. Both of them are shown to be more efficient than original PSO technique. Reconstruction results by using the two presented schemes are compared with exact shapes of some conducting cylinders; and good agreements with the original shapes are observed.

1 citations


Network Information
Related Topics (5)
Genetic algorithm
67.5K papers, 1.2M citations
85% related
Optimization problem
96.4K papers, 2.1M citations
81% related
Artificial neural network
207K papers, 4.5M citations
80% related
Cluster analysis
146.5K papers, 2.9M citations
80% related
Fuzzy logic
151.2K papers, 2.3M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
202213
20217
20209
201922
201815