A Multiple Pairs Shortest Path Algorithm

Authors:
I-Lin Wang;Ellis L. Johnson;Joel S. Sokol
Affiliations:
Department of Industrial and Information Management, National Cheng Kung University, No. 1, University Road, Tainan, Taiwan 701;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205
Venue:
Transportation Science
Year:
2005

Citing 11
Cited 2

Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
Efficient shortest path simplex algorithms

Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A new upper bound on the complexity of the all pairs shortest path problem

Information Processing Letters
Polynomial auction algorithms for shortest paths

Computational Optimization and Applications
On the all-pairs-shortest-path problem in unweighted undirected graphs

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
All pairs shortest paths for graphs with small integer length edges

Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
On shortest paths and sorting

ACM '72 Proceedings of the ACM annual conference - Volume 1
An O(Nm)-Time Network Simplex Algorithm for the Shortest Path Problem

Operations Research
All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithms

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

A comparison of algorithms for origin-destination matrix generation on real road networks and an approximation approach

Computers and Industrial Engineering
Trajectory mining from anonymous binary motion sensors in Smart Environment

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source shortest path (SSSP) and all pairs shortest paths (APSP) algorithms often do unnecessary computation to solve the MPSP problem. We propose a new shortest path algorithm to save computational work when solving the MPSP problem. Our method is especially suitable for applications with fixed network topology but changeable arc lengths and desired OD pairs. Preliminary computational experiments demonstrate our algorithm's superiority on airline network problems over other APSP and SSSP algorithms.