A PATH IDENTIFICATION PROCEDURE FOR NETWORKS

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 applicaple 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. /Author/

• Corporate Authors:

  American Society of Mechanical Engineers

  Two Park Avenue
  New York, NY  United States  10016-5990
• Authors:
  • Gary, D P
• Publication Date: 1974-6

Media Info

• Features: Figures; References;
• Pagination: p. 128-131
• Serial:
  • ASME Transactions
  • Volume: 96
  • Issue Number: 2
  • Publisher: American Society of Mechanical Engineers

Subject/Index Terms

• TRT Terms: Algorithms; Identification systems; Networks; Routing; Traffic control; Walkways
• Uncontrolled Terms: Identification
• Subject Areas: Highways; Operations and Traffic Management; Planning and Forecasting;

Filing Info

• Accession Number: 00096395
• Record Type: Publication
• Files: TRIS
• Created Date: Jul 15 1975 12:00AM