Dispatching Vehicles in a Mega Container Terminal

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 contain...

Full description

Saved in:
Bibliographic Details
Main Authors: BISH, Ebru K., CHEN, Frank Y., LEONG, Thin Yin, Nelson, Barry L., NG, Jonathan W. C., SIMCHI-LEVI, David
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2005
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/1175
https://ink.library.smu.edu.sg/context/sis_research/article/2174/viewcontent/DispatchingVehiclesInAMegaContainerT_afv.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-2174
record_format dspace
spelling sg-smu-ink.sis_research-21742018-11-21T00:26:01Z Dispatching Vehicles in a Mega Container Terminal BISH, Ebru K. CHEN, Frank Y. LEONG, Thin Yin Nelson, Barry L. NG, Jonathan W. C. SIMCHI-LEVI, David 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. 2005-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/1175 info:doi/10.1007/s00291-004-0194-2 https://ink.library.smu.edu.sg/context/sis_research/article/2174/viewcontent/DispatchingVehiclesInAMegaContainerT_afv.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Port terminal operations Vehicle dispatching Heuristics Computer Sciences Operations Research, Systems Engineering and Industrial Engineering Transportation
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Port terminal operations
Vehicle dispatching
Heuristics
Computer Sciences
Operations Research, Systems Engineering and Industrial Engineering
Transportation
spellingShingle Port terminal operations
Vehicle dispatching
Heuristics
Computer Sciences
Operations Research, Systems Engineering and Industrial Engineering
Transportation
BISH, Ebru K.
CHEN, Frank Y.
LEONG, Thin Yin
Nelson, Barry L.
NG, Jonathan W. C.
SIMCHI-LEVI, David
Dispatching Vehicles in a Mega Container Terminal
description 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.
format text
author BISH, Ebru K.
CHEN, Frank Y.
LEONG, Thin Yin
Nelson, Barry L.
NG, Jonathan W. C.
SIMCHI-LEVI, David
author_facet BISH, Ebru K.
CHEN, Frank Y.
LEONG, Thin Yin
Nelson, Barry L.
NG, Jonathan W. C.
SIMCHI-LEVI, David
author_sort BISH, Ebru K.
title Dispatching Vehicles in a Mega Container Terminal
title_short Dispatching Vehicles in a Mega Container Terminal
title_full Dispatching Vehicles in a Mega Container Terminal
title_fullStr Dispatching Vehicles in a Mega Container Terminal
title_full_unstemmed Dispatching Vehicles in a Mega Container Terminal
title_sort dispatching vehicles in a mega container terminal
publisher Institutional Knowledge at Singapore Management University
publishDate 2005
url https://ink.library.smu.edu.sg/sis_research/1175
https://ink.library.smu.edu.sg/context/sis_research/article/2174/viewcontent/DispatchingVehiclesInAMegaContainerT_afv.pdf
_version_ 1770570887183990784