Route planning for transportation systems is strongly related to shortest path algorithms, an optimization problem extensively studied in the literature. To find the shortest path in a network one usually assigns weights to each branch to represent the difficulty of taking such branch. The weights construct a linear preference function ordering the variety of alternatives from the most to the least attractive.Postprint (published version
