An Algorithm to Median Shortest Path Problem (MSPP) in the Design of Urban Transportation Networks

This paper proposes an efficient solution algorithm for realistic multi-objective median shortest path problems in the design of urban transportation networks. The proposed problem formulation and solution algorithm to median shortest path problem is based on three realistic objectives via route cost or investment cost, overall travel time of the entire network and total toll revenue. The proposed solution approach to the problem is based on the heuristic labeling and exhaustive search technique in criteria space and solution space of the algorithm respectively. The first labels each node in terms of route cost and deletes cyclic and infeasible paths in criteria space imposing cyclic break and route cost constraint respectively. The latter deletes dominated paths in terms of objectives vector in solution space in order to identify a set of Pareto optimal paths. The approach, thus, proposes a non-inferior solution set of Pareto optimal paths based on non-dominated objective vector and leaves the ultimate decision to decision-makers for purpose specific final decision during applications. A numerical experiment is conducted to test the proposed algorithm using artificial transportation network. Sensitivity analyses have shown that the proposed algorithm is advantageous and efficient over existing algorithms to find a set of Pareto optimal paths to median shortest paths problems.

• Corporate Authors:

  World Conference on Transport Research Society

  Secretariat, 14 Avenue Berthelot
  69363 Lyon cedex 07,   France 
• Authors:
  • Nepal, Kali Prasad
  • Park, Dongjoo
• Conference:
  • 10th World Conference on Transport Research
  • Location: Istanbul , Turkey
  • Date: 2004-7-4 to 2004-7-8
• Publication Date: 2004

Language

• English

Media Info

• Media Type: CD-ROM
• Features: Figures; References; Tables;
• Pagination: 16p
• Monograph Title: 10th World Conference on Transport Research

Subject/Index Terms

• TRT Terms: Algorithms; Feasibility analysis; Investments; Optimization; Sensitivity analysis; Shortest path algorithms; Transportation planning
• Uncontrolled Terms: Pareto optimum; Transportation networks
• Subject Areas: Highways; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01084973
• Record Type: Publication
• Files: TRIS
• Created Date: Jan 28 2008 8:14AM