RECENT DEVELOPMENTS IN PATH FINDING ALGORITHMS: A REVIEW

Algorithms to determine shortest paths in a network have been studied since the sixties. In this article we discuss recent developments in this field, based on a study of the literature. We compare the performance of the various algorithms. These comparisons are mainly based on tests on real‐life transportation networks. Although the basic form of path finding methods has remained largely the same over the years, it appears that in the last decade considerable improvements have been made in the implementation of the algorithms. These developments provide us with both faster and more robust algorithms.