Distributing empty freight cars throughout railroad system in anticipation of future requirements is allocation problem; actual movement of cars can be examined in terms of space-time diagram; inductive network flow algorithm for solving this problem utilizing network underlying space-time diagram is developed and illustrated by example; computer program implementing this algorithm is discussed, along with context in which it might be used; possible extensions are also presented. (31877)
Network algorithm for empty freight car allocation
IBM Syst J
IBM Systems Journal ; 8 , n 2
1969
23 pages
Article (Journal)
English
© Metadata Copyright Elsevier B. V. All rights reserved.
A network algorithm for empty freight car allocation
Tema Archive | 1969
|Fleet Sizing and Empty Freight Car Allocation
British Library Conference Proceedings | 2018
|Improved Empty Freight Car Distribution
Online Contents | 1998
|Engineering Index Backfile | 1915
Improved Empty Freight Car Distribution
British Library Online Contents | 1998
|