Computing single source shortest paths using single-objective fitness

DOI10.1145/1527125.1527134zbMath1369.68296OpenAlexW1963865903MaRDI QIDQ5276063

Benjamin Doerr, Somenath Biswas, Piyush P. Kurur, Surender Baswana, Frank Neumann, Tobias Friedrich

Publication date: 14 July 2017

Published in: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1527125.1527134

zbMATH Keywords

shortest path

Mathematics Subject Classification ID

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

Related Items (13)

Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial ⋮ Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization ⋮ Design and analysis of migration in parallel evolutionary algorithms ⋮ Runtime analysis of discrete particle swarm optimization applied to shortest paths computation ⋮ Practical performance models of algorithms in evolutionary program induction and other domains ⋮ Adaptive drift analysis ⋮ Running time analysis of ant colony optimization for shortest path problems ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ Multiplicative drift analysis ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem ⋮ The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm ⋮ Optimal parameter choices via precise black-box analysis

This page was built for publication: Computing single source shortest paths using single-objective fitness