Publication Type
Journal Article
Version
publishedVersion
Publication Date
8-2001
Abstract
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.
Discipline
Computer Sciences | Operations Research, Systems Engineering and Industrial Engineering | Transportation
Research Areas
Information Systems and Management
Publication
Naval Research Logistics
Volume
48
Issue
5
First Page
363
Last Page
385
ISSN
0894-069X
Identifier
10.1002/nav.1024
Publisher
Wiley
Citation
BISH, Ebru K.; LEONG, Thin Yin; LI, Chun-Lun; NG, Jonathan W. C.; and SIMCHI-LEVI, David.
Analysis of a New Vehicle Scheduling and Location Problem. (2001). Naval Research Logistics. 48, (5), 363-385.
Available at: https://ink.library.smu.edu.sg/sis_research/5
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1002/nav.1024
Included in
Computer Sciences Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Transportation Commons