Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
DOI10.1007/S00453-018-0451-4zbMATH Open1411.68149OpenAlexW2802344229WikidataQ129850275 ScholiaQ129850275MaRDI QIDQ1725656FDOQ1725656
Authors: Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, F. 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
Recommendations
- Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- scientific article; zbMATH DE number 6019547
- On the analysis of a dynamic evolutionary algorithm
- A runtime analysis of parallel evolutionary algorithms in dynamic optimization
- Some analyses about the time complexity of evolutionary algorithms
- Towards an analytic framework for analysing the computation time of evolutionary algorithms
- Global linear convergence of evolution strategies with recombination on scaling-invariant functions
- Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
- Dynamic of evolutive optimization problems
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Multiplicative drift analysis
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
- 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
- Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
- From black-box complexity to designing new genetic algorithms
- Fixed-parameter evolutionary algorithms and the vertex cover problem
- (1+1) EA on Generalized Dynamic OneMax
- Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints
Cited In (13)
- Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints
- Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
- Running time analysis of the (1+1)-EA for robust linear optimization
- Fixed Budget Performance of the (1+1) EA on Linear Functions
- Program reversals for evolutions with non-uniform step costs
- Pareto optimization for subset selection with dynamic cost constraints
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
- Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem
- Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function
This page was built for publication: Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725656)
