Show simple item record

dc.contributor.authorChoi, Chang-Hoen_US
dc.contributor.authorNepal, Kalien_US
dc.contributor.authorPark, Dongjooen_US
dc.date.accessioned2017-04-04T21:53:53Z
dc.date.available2017-04-04T21:53:53Z
dc.date.issued2009en_US
dc.date.modified2010-06-28T06:32:44Z
dc.identifier.issn0733947Xen_US
dc.identifier.doi10.1061/(ASCE)0733-947X(2009)135:10(783)en_AU
dc.identifier.urihttp://hdl.handle.net/10072/30093
dc.description.abstractIn 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.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherAmerican Society of Civil Engineersen_US
dc.publisher.placeUSAen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom783en_US
dc.relation.ispartofpageto790en_US
dc.relation.ispartofissue10en_AU
dc.relation.ispartofjournalJournal of Transportation Engineeringen_US
dc.relation.ispartofvolume135en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchTransport Engineeringen_US
dc.subject.fieldofresearchcode090507en_US
dc.titleUpgrading Arc Median Shortest Path Problem for an Urban Transportation Networken_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.facultyGriffith Sciences, Griffith School of Engineeringen_US
gro.date.issued2009
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