Skip to main content

Shortest Distances in a Modified Transportation Network

Buy Article:

$43.00 plus tax (Refund Policy)

Taking as the starting point an undirected source network and a set of possible new links that can be used to extend the source network, a method is proposed to determine, by simple inspection of a matrix tableau, all shortest distances in any extended network, without using a shortest path algorithm. In consequence, this method may be a useful tool for analyzing and judging network extensions. In particular, computation time can be saved in many complex network optimization methods that use shortest path algorithms. The computer experiments show that the method is feasible even when an extended network may differ from the source network by several dozens of branches.
No References
No Citations
No Supplementary Data
No Data/Media
No Metrics

Document Type: Original Article

Publication date: 1977-07-01

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more