Dispatching vehicles in a mega container terminal

Ebru K. Bish, Frank Y. Chen, Yin Thin Leong, Barry L. Nelson, Jonathan Wing Cheong Ng, David Simchi-Levi

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 12 - Chapter in an edited book (Author)peer-review

8 Citations (Scopus)

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. © 2007 Springer-Verlag Berlin Heidelberg.
Original languageEnglish
Title of host publicationContainer Terminals and Cargo Systems
Subtitle of host publicationDesign, Operations Management, and Logistics Control Issues
EditorsKap Hwan Kim, Hans-Otto Günther
PublisherSpringer Berlin Heidelberg
Pages179-194
ISBN (Electronic)9783540495505
ISBN (Print)9783540495499
DOIs
Publication statusPublished - 2007
Externally publishedYes

Research Keywords

  • Heuristics
  • Port terminal operations
  • Vehicle dispatching

Fingerprint

Dive into the research topics of 'Dispatching vehicles in a mega container terminal'. Together they form a unique fingerprint.

Cite this