Show simple item record

dc.contributor.authorNepal, Kali Prasaden_US
dc.contributor.authorPark, Dongjooen_US
dc.date.accessioned2017-05-03T15:52:15Z
dc.date.available2017-05-03T15:52:15Z
dc.date.issued2005en_US
dc.date.modified2010-08-16T06:47:31Z
dc.identifier.issn0308-1060en_US
dc.identifier.doi10.1080/03081060500053509en_AU
dc.identifier.urihttp://hdl.handle.net/10072/33467
dc.description.abstractThis 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.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherTaylor & Francis Ltd.en_US
dc.publisher.placeUnited Kingdomen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom113en_US
dc.relation.ispartofpageto133en_US
dc.relation.ispartofissue2en_US
dc.relation.ispartofjournalTransportation Planning and Technologyen_US
dc.relation.ispartofvolume28en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchCivil Engineering not elsewhere classifieden_US
dc.subject.fieldofresearchcode090599en_US
dc.titleSolving the Median Shortest Path Problem in the Planning and Design of Urban Transportation Networks Using a Vector Labeling Algorithmen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.date.issued2005
gro.hasfulltextNo Full Text


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record