You are not logged in.

An algorithm to median shortest path problem (MSPP) in the design of urban transportation networks

Nepal, Kali Prasad and Park, Dongjoo 2004, An algorithm to median shortest path problem (MSPP) in the design of urban transportation networks, in WCTRS 2004 : Proceedings of the 10th World Conference on Transport Research, WCTRS, Istanbul, Turkey, pp. 1-16.

Attached Files
Name Description MIMEType Size Downloads

Title An algorithm to median shortest path problem (MSPP) in the design of urban transportation networks
Author(s) Nepal, Kali Prasad
Park, Dongjoo
Conference name World Conference on Transport Research (10th : 2004 : Istanbul, Turkey)
Conference location Istanbul, Turkey
Conference dates 4-8 Jul. 2004
Title of proceedings WCTRS 2004 : Proceedings of the 10th World Conference on Transport Research
Editor(s) [Unknown]
Publication date 2004
Conference series World Conference on Transport Research
Start page 1
End page 16
Total pages 16
Publisher WCTRS
Place of publication Istanbul, Turkey
Keyword(s) algorithms; feasibility analysis; investments; optimization; pareto optimum; sensitivity analysis; shortest path algorithms; transportation networks; transportation planning
Summary 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.
Language eng
Field of Research 099999 Engineering not elsewhere classified
Socio Economic Objective 970109 Expanding Knowledge in Engineering
HERDC Research category E1.1 Full written paper - refereed
Persistent URL http://hdl.handle.net/10536/DRO/DU:30054256

Document type: Conference Paper
Collection: School of Engineering
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 109 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Wed, 17 Jul 2013, 16:13:23 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.