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 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.
Port terminal operations, Vehicle dispatching, Heuristics
Computer Sciences | Operations Research, Systems Engineering and Industrial Engineering | Transportation
Intelligent Systems and Decision Analytics
BISH, Ebru K.; CHEN, Frank Y.; LEONG, Thin Yin; Nelson, Barry L.; NG, Jonathan W. C.; and Simchi-Levi, David.
Dispatching Vehicles in a Mega Container Terminal. (2005). OR Spectrum. 27, (4), 491-506. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1175