Distributing empty freight cars throughout a railroad system in anticipation of future requirements is an allocation problem. the actual movement of cars can be examined in terms of a space-time diagram. An inductive network flow algorithm for solving this problem utilizing the network underlying the space-time diagram is developed and illustrated by an example. A computer program implementing this algorithm is discussed, along with the context in which it might be used. Possible extensions are also presented.
A network algorithm for empty freight car allocation
IBM Systems Journal ; 8 , 2 ; 147-169
1969
23 Seiten, 10 Bilder, 12 Quellen
Article (Journal)
English
Network algorithm for empty freight car allocation
Engineering Index Backfile | 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
|