Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
From MaRDI portal
Publication:1853460
DOI10.1016/S0304-3975(02)00094-4zbMath1061.68145DBLPjournals/tcs/DrosteJW02aWikidataQ56431140 ScholiaQ56431140MaRDI QIDQ1853460
Stefan Droste, Ingo Wegener, Thomas Jansen
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items (13)
Drift Analysis and Evolutionary Algorithms Revisited ⋮ Continuous lunches are free plus the design of optimal optimization algorithms ⋮ No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics ⋮ Runtime analysis of the \((1+1)\) EA on computing unique input output sequences ⋮ Do additional target points speed up evolutionary algorithms? ⋮ Free lunches on the discrete Lipschitz class ⋮ Hybridizing evolutionary algorithms with variable-depth search to overcome local optima ⋮ A framework for co-optimization algorithm performance and its application to worst-case optimization ⋮ Workforce planning in the printing industry ⋮ A no-free-lunch theorem for non-uniform distributions of target functions ⋮ On classes of functions for which no free lunch results hold ⋮ The impact of parametrization in memetic evolutionary algorithms ⋮ Optimization, block designs and no free lunch theorems
Uses Software
Cites Work
This page was built for publication: Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
