Show simple item record

dc.contributor.authorNepal, Kali
dc.contributor.authorPark, Dongjoo
dc.contributor.authorChoi, Chang-Ho
dc.date.accessioned2017-05-03T15:34:08Z
dc.date.available2017-05-03T15:34:08Z
dc.date.issued2009
dc.date.modified2010-06-28T06:32:44Z
dc.identifier.issn0733947X
dc.identifier.doi10.1061/(ASCE)0733-947X(2009)135:10(783)
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.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.languageEnglish
dc.language.isoeng
dc.publisherAmerican Society of Civil Engineers
dc.publisher.placeUSA
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom783
dc.relation.ispartofpageto790
dc.relation.ispartofissue10
dc.relation.ispartofjournalJournal of Transportation Engineering
dc.relation.ispartofvolume135
dc.rights.retentionY
dc.subject.fieldofresearchTransport Engineering
dc.subject.fieldofresearchCivil Engineering
dc.subject.fieldofresearchTransportation and Freight Services
dc.subject.fieldofresearchcode090507
dc.subject.fieldofresearchcode0905
dc.subject.fieldofresearchcode1507
dc.titleUpgrading Arc Median Shortest Path Problem for an Urban Transportation Network
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, Griffith School of Engineering
gro.date.issued2009
gro.hasfulltextNo Full Text
gro.griffith.authorNepal, Kali P.


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