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

There are no files associated with this record.

Title Solving the Median Shortest Path Problem in the Planning and Design of Urban Transportation Networks Using a Vector Labeling Algorithm
Author Nepal, Kali Prasad; Park, Dongjoo
Journal Name Transportation Planning and Technology
Year Published 2005
Place of publication United Kingdom
Publisher Taylor & Francis Ltd.
Abstract 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.
Peer Reviewed Yes
Published Yes
Alternative URI http://dx.doi.org/10.1080/03081060500053509
Volume 28
Issue Number 2
Page from 113
Page to 133
ISSN 0308-1060
Date Accessioned 2010-03-15
Date Available 2010-08-16T06:47:31Z
Language en_AU
Faculty Faculty of Science, Environment, Engineering and Technology
Subject Civil Engineering
URI http://hdl.handle.net/10072/33467
Publication Type Journal Articles (Refereed Article)
Publication Type Code c1x

Brief Record

Griffith University copyright notice