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

No Thumbnail Available
File version
Author(s)
Nepal, Kali Prasad
Park, Dongjoo
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2005
Size
File type(s)
Location
License
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.

Journal Title

Transportation Planning and Technology

Conference Title
Book Title
Edition
Volume

28

Issue

2

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Civil Engineering not elsewhere classified

Civil Engineering

Urban and Regional Planning

Transportation and Freight Services

Persistent link to this record
Citation
Collections