A Path Identification Procedure for Networks

Abstract

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.