|Type of publication:||Inproceedings|
|Title||Improved Alternative Route Planning|
|Bibtex cite ID||RACTI-RU1-2013-33|
|Booktitle ||Algorithmic Approaches for Transportation Modeling, Optimization, and Systems – ATMOS 2013|
|Series ||OASICS Series|
|Year published ||2013|
|Keywords ||Alternative route,stretch factor,shortest path,non-overlapping path,Penalty,Plateau|
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
characterized by minimum path overlap, small stretch factor, as well as low size and complexity.
Our approach improves upon a previous one by introducing a new pruning stage preceding any
other heuristic method 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.
|Topics ||=SEE CLASSIFICATION DIFFERENCE FROM OTHERS=
=SEE OWN CLASSIFICATION=|
C64-ATMOS2013-AltRoutes.pdf (main file) |