More effective crossover operators for the all-pairs shortest path problem
From MaRDI portal
Publication:1935817
DOI10.1016/j.tcs.2012.10.059zbMath1259.68180OpenAlexW1884986037MaRDI QIDQ1935817
Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile, Benjamin Doerr
Publication date: 19 February 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.059
Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (10)
Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem ⋮ A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ Memetic algorithms outperform evolutionary algorithms in multimodal optimisation ⋮ Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Reducing the arity in unbiased black-box complexity ⋮ Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
This page was built for publication: More effective crossover operators for the all-pairs shortest path problem
