A network algorithm for empty freight car allocation
William White, A. M. Bomberault
Abstract
William White, A. M. Bomberault
Abstract
Some of the earliest applications of operations research techniques were made in the field of transportation. Until recently, however, little was done within the railroad industry. This paper describes an application of network flow analysis to onc problem of that industry: empty freight car allocation. Other modes of transportation may benefit from the Same analysis and the algorithm developed herein.
OpenAlex reports 118 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Some of the earliest applications of operations research techniques were made in the field of transportation. Until recently, however, little was done within the railroad industry. This paper describes an application of network flow analysis to onc problem of that industry: empty freight car allocation. Other modes of transportation may benefit from the Same analysis and the algorithm developed herein.
Key concepts: Flow network, Transportation industry, Computer science, Field (mathematics), Operations research, Transport engineering, Algorithm, Engineering