Geographic Decomposition of the Shortest Path Problem, with an Application to the Traffic Assignment Problem

Zachary F. Lansdowne and David W. Robinson
Additional contact information
Zachary F. Lansdowne: Control Analysis Corporation, Palo Alto, California
David W. Robinson: University Analytics, Inc., Durham, North Carolina

Management Science, 1982, vol. 28, issue 12, 1380-1390

Abstract: An algorithm, which can be applied to loosely connected networks, is given for geographically decomposing the shortest path problem. The algorithm is applicable to the traffic assignment problem when it is solved as a series of shortest path problems by the Frank-Wolfe algorithm. Numerical results for a large 1287 node, 3752 arc traffic assignment problem for Washington, D.C., indicate that using geographical decomposition can reduce computer memory storage requirements or program run time.

Keywords: networks/graphs: distance algorithms; programming: large scale systems; transportation: traffic assignment (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.28.12.1380 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:28:y:1982:i:12:p:1380-1390

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().