Premium
A new approach to near‐optimal path assignment through electric‐circuit modeling
Author(s) -
Smolleck Howard A.,
Chen MoShing
Publication year - 1981
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230110403
Subject(s) - computer science , path (computing) , algorithm , electric power system , electrical network , power (physics) , mathematical optimization , mathematics , engineering , electrical engineering , physics , quantum mechanics , programming language
Abstract This paper introduces a new philosophy and an associated computational algorithm for obtaining near‐optimal path assignments in a connected network. The method, which differs completely from traditional and other currently used techniques, is based upon the performance of successive computational examinations of the distribution of currents in the electric‐circuit model of the network under observation. Fast sparse‐matrix techniques originally developed for real‐time studies in the electric power sector are introduced in order to make the algorithm feasible for large‐system applications. Small illustrative examples are presented, and observations concerning the use of the authors' algorithm in the solution of a large transportation system problem are discussed. Some unique characteristics of the algorithm are explored.