File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Modification of dial's algorithm by redefining path efficiency

TitleModification of dial's algorithm by redefining path efficiency
Authors
Issue Date1990
Citation
Traffic Engineering And Control, 1990, v. 31 n. 8-9, p. 483-486 How to Cite?
AbstractDial's multipath assignment algorithm assumes that trips are only assigned onto efficient paths. Hence the definition of efficient paths is a fundamental element of the algorithm. Dial has actually proposed two algorithms, each using a different definition of efficient paths. Algorithm 1 defines an efficient path as one that always moves further away from the origin and closer to the destination. Algorithm 2 defines an efficient path as one that always moves further away from the origin. This paper proposes a third definition and a third algorithm. Algorithm 3 redefines an efficient path as one that either always moves further away from the origin or one that always moves closer to the destination. A hypothetical grid network is used to illustrate the three different assignment algorithms.
Persistent Identifierhttp://hdl.handle.net/10722/149939
ISSN
2015 SCImago Journal Rankings: 0.100

 

DC FieldValueLanguage
dc.contributor.authorTong, COen_US
dc.date.accessioned2012-06-26T06:00:40Z-
dc.date.available2012-06-26T06:00:40Z-
dc.date.issued1990en_US
dc.identifier.citationTraffic Engineering And Control, 1990, v. 31 n. 8-9, p. 483-486en_US
dc.identifier.issn0041-0683en_US
dc.identifier.urihttp://hdl.handle.net/10722/149939-
dc.description.abstractDial's multipath assignment algorithm assumes that trips are only assigned onto efficient paths. Hence the definition of efficient paths is a fundamental element of the algorithm. Dial has actually proposed two algorithms, each using a different definition of efficient paths. Algorithm 1 defines an efficient path as one that always moves further away from the origin and closer to the destination. Algorithm 2 defines an efficient path as one that always moves further away from the origin. This paper proposes a third definition and a third algorithm. Algorithm 3 redefines an efficient path as one that either always moves further away from the origin or one that always moves closer to the destination. A hypothetical grid network is used to illustrate the three different assignment algorithms.en_US
dc.languageengen_US
dc.relation.ispartofTraffic Engineering and Controlen_US
dc.titleModification of dial's algorithm by redefining path efficiencyen_US
dc.typeArticleen_US
dc.identifier.emailTong, CO:cotong@hku.hken_US
dc.identifier.authorityTong, CO=rp00178en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0025476202en_US
dc.identifier.volume31en_US
dc.identifier.issue8-9en_US
dc.identifier.spage483en_US
dc.identifier.epage486en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridTong, CO=7202715087en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats