Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem

DOI10.1145/1527125.1527140zbMath1369.68311OpenAlexW1967363967MaRDI QIDQ5276069

Christian Thyssen

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: http://hdl.handle.net/2003/26165

zbMATH Keywords

combinatorial optimizationmultiobjective optimizationevolutionary algorithmsapproximation algorithmsshortest path problemFPRASruntime analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Evolutionary algorithms and dynamic programming

This page was built for publication: Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem