Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers

Abstract

Abstract The movement of vehicles and goods in a transportation system can be represented as flows through a time‐dependent transshipment network. An inductive out‐of‐kilter type of algorithm is presented which utilizes the basic underlying properties of the dynamic transshipment network to optimize the flow of a homogeneous commodity through the network, given a linear cost function. The algorithm is illustrated by its application to the problem of distributing empty containers from locations at which they are available to locations at which they are required.