Follow us on
Improved Alternative Route Planning
Submitted by gkortsilas on Thu, 2013-07-11 12:15
Publication Date:
August, 2013
Abstract:
We present improved methods for computing a set of alternative source-to-destination routes
in road networks in the form of an alternative graph. The resulting alternative graphs are charac-
terized by minimum path overlap, small stretch factor, as well as and low size and complexity.
Our approach improves upon a previous one by introducing a new pruning stage preceding any
other heuristic methods and by introducing a new filtering and fine-tuning of two existing
methods. Our accompanying experimental study shows that the entire alternative graph
can be computed pretty fast even in continental size networks.
File:
Work Packages:
Publication Details:
ATMOS 2013
