Show simple item record

dc.contributor.authorD. P. Garg
dc.date.accessioned2017-05-09T01:37:54Z
dc.date.available2017-05-09T01:37:54Z
dc.date.copyrightJune, 1974
dc.date.issued1974
dc.identifier.issn0022-0434
dc.identifier.otherJDSMAA-26014#128_1.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/164645
dc.description.abstractA generalized procedure has been advanced for path identification in complex multiloop interconnected directed networks. Reference to transportation networks has been made for the sake of specificity in this paper although the proposed method is equally applicable to all types of directed networks. Typically, one may utilize such procedures for developing information aimed at an efficient traffic rerouting between a given origin-destination pair. The rerouting may be necessitated by situations such as vehicular congestion or adverse weather conditions along a previously assigned nodal segment. A network example illustrates the application of proposed algorithm.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleA Path Identification Procedure for Networks
dc.typeJournal Paper
dc.journal.volume96
dc.journal.issue2
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.3426784
dc.journal.fristpage128
dc.journal.lastpage131
dc.identifier.eissn1528-9028
dc.keywordsNetworks
dc.keywordsTraffic
dc.keywordsAlgorithms AND Transportation systems
dc.treeJournal of Dynamic Systems, Measurement, and Control:;1974:;volume( 096 ):;issue: 002
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record