Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem.
We present a natural vector-valued fitness function f for the multi-objective shortest path problem, which is a fundamental multi-objective combinatorial optimization problem known to be NP-hard. Thereafter, we conduct a rigorous runtime analysis of a simple evolutionary algorithm (EA) optimizing f. Interestingly, this simple general algorithm is a fully polynomial-time randomized approximation scheme (FPRAS) for the problem under consideration, which exemplifies how EAs are able to find good approximate solutions for hard problems. Furthermore, we present lower bounds for the worst-case optimization time.
Horoba
Christian
C
Fakultät für Informatik, TU Dortmund, 44221 Dortmund, Germany. horoba@ls2.cs.tu-dortmund.de
D000465:Algorithms; D005075:Biological Evolution; D015233:Models, Statistical