Analysis of a new vehicle scheduling and location problem

Ebru K. Bish, Thin Yin Leong, Chung Lun Li, Jonathan W.C. Ng, David Simchi-Levi

Research output: Journal article publicationJournal articleAcademic researchpeer-review

122 Citations (Scopus)


We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP-hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst-case and computational points of view.
Original languageEnglish
Pages (from-to)363-385
Number of pages23
JournalNaval Research Logistics
Issue number5
Publication statusPublished - 1 Aug 2001
Externally publishedYes

ASJC Scopus subject areas

  • Modelling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research


Dive into the research topics of 'Analysis of a new vehicle scheduling and location problem'. Together they form a unique fingerprint.

Cite this