You are not logged in.

Solving the median shortest path problem in the planning and design of urban transportation networks using a vector labeling algorithm

Nepal, Kali Prasad and Park, Dongjoo 2005, Solving the median shortest path problem in the planning and design of urban transportation networks using a vector labeling algorithm, Transportation planning and technology, vol. 28, no. 2, pp. 113-133, doi: 10.1080/03081060500053509.

Attached Files
Name Description MIMEType Size Downloads

Title Solving the median shortest path problem in the planning and design of urban transportation networks using a vector labeling algorithm
Author(s) Nepal, Kali Prasad
Park, Dongjoo
Journal name Transportation planning and technology
Volume number 28
Issue number 2
Start page 113
End page 133
Total pages 21
Publisher Taylor & Francis
Place of publication New York, N.Y.
Publication date 2005-04
ISSN 0308-1060
1029-0354
Keyword(s) median shortest path problem (MSPP)
pareto optimal paths (POP)
transportation networks
vector labeling algorithm
Summary This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.
Language eng
DOI 10.1080/03081060500053509
Field of Research 090507 Transport Engineering
Socio Economic Objective 880106 Road Infrastructure and Networks
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©2005, Taylor & Francis Group Ltd
Persistent URL http://hdl.handle.net/10536/DRO/DU:30047932

Document type: Journal Article
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 5 times in TR Web of Science
Scopus Citation Count Cited 7 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 135 Abstract Views, 31 File Downloads  -  Detailed Statistics
Created: Mon, 03 Sep 2012, 14:20:32 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.