# Shortest paths algorithms: Theory and experimental evaluation

## Abstract

We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research.

### Keywords

Graph algorithms Network optimization Shortest paths Theory and experimental evaluation of algorithms## Copyright information

© The Mathematical Programming Society, Inc. 1996