Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 52, Issue 4, Pages 409-417Publisher
NATURE PUBLISHING GROUP
DOI: 10.1057/palgrave.jors.2601094
Keywords
logistics; container terminal; AGVs; networks and graphs
Ask authors/readers for more resources
This paper describes the development of a minimum flow algorithm to determine the number of automated guided vehicles (AGVs) required at a semi-automated container terminal. At such a terminal the containers are transported by AGVs from the quay cranes to the automated slacking cranes and vice versa. A model and a strongly polynomial time algorithm are developed to solve the case in which containers are available for transport at known time instants.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available