THE MEDIAN SHORTEST PATH PROBLEM : A MULTIOBJECTIVE APPROACH TO ANALYZE COST VS. ACCESSIBILITY IN THE DESIGN OF TRANSPORTATION NETWORKS

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.

[1]  P. Harker,et al.  MULTICRITERIA SPATIAL PRICE EQUILIBRIUM NETWORK DESIGN: THEORY AND COMPUTATIONAL RESULTS , 1983 .

[2]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[3]  Toshihide Ibaraki,et al.  An efficient algorithm for K shortest simple paths , 1982, Networks.

[4]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[5]  Charles ReVelle,et al.  Optimal location under time or distance constraints , 1972 .

[6]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[7]  D. Halder,et al.  A METHOD FOR SELECTING OPTIMUM NUMBER OF STATIONS FOR A RAPID TRANSIT LINE : AN APPLICATION IN CALCUTTA TUBE RAIL , 1981 .

[8]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[9]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[10]  Terry L. Friesz.  Multiobjective Optimization in Transportation: The Case of Equilibrium Network Design , 1981 .

[11]  Lawrence Bodin,et al.  Current and future research directions in network optimization , 1981, Comput. Oper. Res..

[12]  Don T. Phillips,et al.  Fundamentals Of Network Analysis , 1981 .

[13]  Hokey Min,et al.  Multiobjective design of transportation networks: taxonomy and annotation , 1986 .

[14]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[15]  P. Harker,et al.  Multi-Objective Design of Transportation Networks: The Case of Spatial Price Equilibrium , 1983 .

[16]  Charles ReVelle,et al.  SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER.: THE SHORTEST COVERING PATH PROBLEM: AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN , 1984 .

[17]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

[18]  Nancy L. Nihan,et al.  A PLANNING MODEL FOR MULTIPLE-MODE TRANSPORTATION SYSTEM OPERATIONS , 1976 .

[19]  A. Scott.  The optimal network problem: Some computational procedures , 1969 .

[20]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[21]  Marc Los,et al.  Combinatorial Programming, Statistical Optimization and the Optimal Transportation Network Problem , 1980 .

[22]  John R Current,et al.  Multiobjective design of transportation networks , 1981 .

[23]  J. Current,et al.  The maximum covering/shortest path problem: A multiobjective network design and routing formulation , 1985 .

[24]  Douglas R. Shier,et al.  Iterative methods for determining the k shortest paths in a network , 1976, Networks.