A network algorithm for empty freight car allocation
by W. W. White, A. M. Bomberault
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.