Gradient subspace approximation: a direct search method for memetic computing

The hybridization of evolutionary algorithms and local search techniques as, e.g., mathematical programming techniques, also referred to as memetic algorithms, has caught the interest of many researchers in the recent past. Reasons for this include that the resulting algorithms are typically robust...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Soft computing (Berlin, Germany) Ročník 21; číslo 21; s. 6331 - 6350
Hlavní autori: Schütze, Oliver, Alvarado, Sergio, Segura, Carlos, Landa, Ricardo
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2017
Springer Nature B.V
Predmet:
Algorithms
Approximation
Artificial Intelligence
Computational Intelligence
Control
Engineering
Evolutionary algorithms
Evolutionary computation
Heuristic
Mathematical Logic and Foundations
Mathematical programming
Mechatronics
Methodologies and Application
Neighborhoods
Optimization
Robotics
Robustness (mathematics)
Search methods
Memetic computing
Differential evolution
Direct search
Evolutionary algorithms
Scalar optimization
ISSN:1432-7643, 1433-7479
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The hybridization of evolutionary algorithms and local search techniques as, e.g., mathematical programming techniques, also referred to as memetic algorithms, has caught the interest of many researchers in the recent past. Reasons for this include that the resulting algorithms are typically robust and reliable since they take the best of both worlds. However, one crucial drawback of such hybrids is the relatively high cost of the local search techniques since many of them require the gradient or even the Hessian at each candidate solution. Here, we propose an alternative way to compute search directions by exploiting the neighborhood information. That is, for a given point within a population P , the neighboring solutions in P are used to compute the most greedy search direction out of the given data. The method is hence particularly interesting for the usage within population-based search strategies since the search directions come ideally for free in terms of additional function evaluations. In this study, we analyze the novel method first as a stand-alone algorithm and show further on its benefit as a local searcher within differential evolution.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-016-2187-x