Abstract.
We consider a container terminal discharging and uploading containers to and from ships. The discharged containers are stored at prespecified storage locations in the terminal yard. Containers are moved between the ship area and the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to dispatch vehicles to the containers so as to minimize the total time it takes to serve a ship, which is the total time it takes to discharge all containers from the ship and upload new containers onto the ship. We develop easily implementable heuristic algorithms and identify both the absolute and asymptotic worst-case performance ratios of these heuristics. In simple settings, most of these algorithms are optimal, while in more general settings, we show, through numerical experiments, that these algorithms obtain near-optimal results for the dispatching problem.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Research was supported in part by the Port of Singapore Authority (PSA).
Rights and permissions
About this article
Cite this article
Bish, E.K., Chen, F.Y., Leong, Y.T. et al. Dispatching vehicles in a mega container terminal. OR Spectrum 27, 491–506 (2005). https://doi.org/10.1007/s00291-004-0194-2
Issue Date:
DOI: https://doi.org/10.1007/s00291-004-0194-2