Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints

DOI10.1007/S00453-018-0451-4zbMath1411.68149OpenAlexW2802344229MaRDI QIDQ1725656

Timo Kötzing, Feng Shi, Martin Schirneck, Tobias Friedrich, Frank Neumann

Publication date: 14 February 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0451-4

zbMATH Keywords

evolutionary algorithmruntime analysisdynamic constraintreoptimization timeuniform constraint

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Result diversification by multi-objective evolutionary algorithms with theoretical guarantees ⋮ Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem ⋮ Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints ⋮ Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function ⋮ Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem ⋮ Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem ⋮ Running time analysis of the (1+1)-EA for robust linear optimization ⋮ Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints ⋮ Pareto optimization for subset selection with dynamic cost constraints

Cites Work

• Unnamed Item
• Unnamed Item
• From black-box complexity to designing new genetic algorithms
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Minimum spanning trees made easier via multi-objective optimization
• On the analysis of the \((1+1)\) evolutionary algorithm
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Multiplicative drift analysis
• Fixed-parameter evolutionary algorithms and the vertex cover problem
• Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• (1+1) EA on Generalized Dynamic OneMax
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints

This page was built for publication: Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints