Determination of the number of AGVs in a semi-automated container terminal
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||AGVs, container terminals, logisstics, networks and graphs|
Vis, I.F.A., de Koster, M.B.M., Roodbergen, K.J., & Peeters, L.W.P.. (2001). Determination of the number of AGVs in a semi-automated container terminal. Operational Research Society. Journal, 409–417. Retrieved from http://hdl.handle.net/1765/11856