Abstract
AbstractThe 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
