Computing optimal paths on multimodal graphs

Speeding up techniques are proposed and tested for shortest path algorithms based on A*. We prove that, with respect to the classic Dijkstra algorithm, A* based implementation with pre-processing and bounding box can reduce the computational time by a factor of 9.

Supervisors:  Fabio Schoen, Paola Cappanera, Mirko Maischberger

Candidate: Alessandro Lori

Date:

09/2007

laurea: specialistica Ingegneria Informatica