Accession Number:

AD0661265

Title:

AN APPRAISAL OF SOME SHORTEST PATH ALGORITHMS

Descriptive Note:

Memorandum

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1967-10-01

Pagination or Media Count:

41.0

Abstract:

A critical review of the literature of shortest paths in networks that examines methods for determining 1 the shortest path between two specified nodes 2 the shortest path between all pairs of nodes 3 the second, third, etc., shortest path 4 the fastest path through a network with travel times depending on the departure time and 5 the shortest path between specified endpoints that passes through specified intermediate nodes. Inefficient algorithms, erroneous procedures, and false assumptions in the current literature are identified.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE