Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
From MaRDI portal
Publication:3104635
DOI10.1007/978-3-642-25591-5_42zbMath1350.68248arXiv1109.1766OpenAlexW2104529187MaRDI QIDQ3104635
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.1766
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
A runtime analysis of parallel evolutionary algorithms in dynamic optimization ⋮ Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization ⋮ The cost of randomness in evolutionary algorithms: crossover can save random bits ⋮ Lower bounds from fitness levels made easy ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ Island models meet rumor spreading
This page was built for publication: Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
