Upgrading arc median shortest path problem for an urban transportation network

Nepal, Kali P., Park, Dongjoo and Choi, Chang-Ho 2009, Upgrading arc median shortest path problem for an urban transportation network, Journal of transportation engineering, vol. 135, no. 10, pp. 783-790, doi: 10.1061/(ASCE)0733-947X(2009)135:10(783).

Attached Files
Name Description MIMEType Size Downloads

Title Upgrading arc median shortest path problem for an urban transportation network
Author(s) Nepal, Kali P.ORCID iD for Nepal, Kali P. orcid.org/0000-0001-7497-1983
Park, Dongjoo
Choi, Chang-Ho
Journal name Journal of transportation engineering
Volume number 135
Issue number 10
Start page 783
End page 790
Total pages 8
Publisher American Society of Civil Engineers
Place of publication Reston, Va.
Publication date 2009
ISSN 0733-947X
Keyword(s) transportation networks
multiple objective analysis
urban transportation
travel time
Summary In this paper, we propose an algorithm for an upgrading arc median shortest path problem for a transportation network. The problem is to identify a set of nondominated paths that minimizes both upgrading cost and overall travel time of the entire network. These two objectives are realistic for transportation network problems, but of a conflicting and noncompensatory nature. In addition, unlike upgrading cost which is the sum of the arc costs on the path, overall travel time of the entire network cannot be expressed as a sum of arc travel times on the path. The proposed solution approach to the problem is based on heuristic labeling and exhaustive search techniques, in criteria space and solution space, respectively. The first approach labels each node in terms of upgrading cost, and deletes cyclic and infeasible paths in criteria space. The latter calculates the overall travel time of the entire network for each feasible path, deletes dominated paths on the basis of the objective vector and identifies a set of Pareto optimal paths in the solution space. The computational study, using two small-scale transportation networks, has demonstrated that the algorithm proposed herein is able to efficiently identify a set of nondominated median shortest paths, based on two conflicting and noncompensatory objectives.
Language eng
DOI 10.1061/(ASCE)0733-947X(2009)135:10(783)
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 ©2009, ASCE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30047855

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.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in TR Web of Science
Scopus Citation Count Cited 3 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 174 Abstract Views, 4 File Downloads  -  Detailed Statistics
Created: Mon, 03 Sep 2012, 14:10:03 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.