Article ID: | iaor20014045 |
Country: | United Kingdom |
Volume: | 52 |
Issue: | 4 |
Start Page Number: | 409 |
End Page Number: | 417 |
Publication Date: | Apr 2001 |
Journal: | Journal of the Operational Research Society |
Authors: | Vis I.F.A., Koster R. de, Roodbergen, K.J., Peeters L.W.P. |
Keywords: | networks: flow |
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 polynomial time algorithm are developed to solve the case in which containers are available for transport at known time instants.