Dispatching vehicles in a mega container terminal

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

79 Scopus Citations
View graph of relations

Author(s)

  • Ebru K. Bish
  • Yin Thin Leong
  • Barry L. Nelson
  • Jonathan Wing Cheong Ng
  • David Simchi-Levi

Detail(s)

Original languageEnglish
Pages (from-to)491-506
Journal / PublicationOR Spectrum
Volume27
Issue number4
Publication statusPublished - Aug 2005
Externally publishedYes

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.

Research Area(s)

  • Heuristics, Port terminal operations, Vehicle dispatching

Citation Format(s)

Dispatching vehicles in a mega container terminal. / Bish, Ebru K.; Chen, Frank Y.; Leong, Yin Thin; Nelson, Barry L.; Ng, Jonathan Wing Cheong; Simchi-Levi, David.

In: OR Spectrum, Vol. 27, No. 4, 08.2005, p. 491-506.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review