The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks

John R. Current, Charles S. Revelle and Jared L. Cohon
Additional contact information
John R. Current: The Ohio State University, Columbus, Ohio
Charles S. Revelle: The Johns Hopkins University, Baltimore, Maryland
Jared L. Cohon: The Johns Hopkins University, Baltimore, Maryland

Transportation Science, 1987, vol. 21, issue 3, 188-197

Abstract: In this paper the authors introduce the median shortest path problem (MSPP). The MSPP is a bicriterion path problem with the objectives being the minimization of the total path length and the minimization of the total travel time required for demand to reach a node on the path. Potential applications of the MSPP include, among others, the location of new highways, railroad lines and subway lines and the design of airline routes. It is particularly applicable in transportation network design problems where the trade-off between operator costs and user costs is important. An algorithm is presented to identify noninferior solutions to the MSPP. This algorithm incorporates a K shortest path algorithm. The algorithm is demonstrated with a sample problem and the results are compared to those obtained using integer programming.

Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.21.3.188 (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:ortrsc:v:21:y:1987:i:3:p:188-197

Access Statistics for this article

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