Solving the Median Shortest Path Problem in the Planning and Design of Urban Transportation Networks Using a Vector Labeling Algorithm

This paper proposes an alternative vector labeling algorithm to solve the median shortest path problem (MSPP) in planning and design of urban transportation by considering path cost and access cost as two conflicting objectives. Proposed is an integer programming formulation using the double sweep method of k-paths generation in the criteria space using path cost as an attribute and an exhaustive search for minimum access cost to those generated paths in order to delete dominated paths. The sensitivity analysis of the results has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767712
• Authors:
  • Nepal, Kali Prasad
  • Park, Dongjoo
• Publication Date: 2005-4

Language

• English

Media Info

• Media Type: Print
• Features: Figures; References; Tables;
• Pagination: pp 113-133
• Serial:
  • Transportation Planning and Technology
  • Volume: 28
  • Issue Number: 2
  • Publisher: Taylor & Francis
  • ISSN: 0308-1060
  • Serial URL: https://www.tandfonline.com/toc/gtpt20/current

Subject/Index Terms

• TRT Terms: Costs; Integer programming; Network analysis; Sensitivity analysis; Shortest path algorithms; Urban transportation
• Uncontrolled Terms: Vector labeling
• Subject Areas: Finance; Highways; Planning and Forecasting;

Filing Info

• Accession Number: 01000905
• Record Type: Publication
• Files: TRIS
• Created Date: Jun 15 2005 12:35PM