A Path Identification Procedure for Networks

[+] Author and Article Information
D. P. Garg

Department of Mechanical Engineering, Duke University, Durham, N.C.

J. Dyn. Sys., Meas., Control 96(2), 128-131 (Jun 01, 1974) (4 pages) doi:10.1115/1.3426784 History: Received August 09, 1973; Online July 13, 2010


A 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.

Copyright © 1974 by ASME
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In