Efficient paths by local search

Authors

Abstract

In this article, we describe an experimental analysis on a given property of connectedness of optimal paths for the multicriteria shortest path problem. Moreover, we propose a local search that explores this property and compare its performance with an exact algorithm in terms of running time and number of optimal paths found.

Conference

7th Workshop on Applied Combinatorial Optimization (ALIO/EURO), March 2011