Determination of the number of AGVs in a semi-automated container terminal


Article
pp 409-417.
This publication is part of collection
Repository contains one file which is not publicly available

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 stacking cranes and vice versa. A model and a strongly poly~lomial time algorithm are developed to solve the case in which containers are available for transport at known time instants.



Keywords