Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization
DOI10.1016/J.TCS.2014.06.037zbMath1360.68783OpenAlexW2043858810MaRDI QIDQ403016
Publication date: 29 August 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.037
combinatorial optimizationisland modelruntime analysisoffspring populationsparallel evolutionary algorithmsspatial structures
Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Parallel evolutionary algorithms can achieve super-linear performance
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- Parallel genetic algorithms. Theory and real world applications
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
- Spatially structured evolutionary algorithms. Artificial evolution in space and time
- Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
- Parallel metaheuristics: recent advances and new trends
- Computing single source shortest paths using single-objective fitness
- Adaptive population models for offspring populations and parallel evolutionary algorithms
- Parallel Metaheuristics
- Artificial Evolution
This page was built for publication: Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization
