Analysis of a New Vehicle Scheduling and Location Problem
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.
Computer Sciences | Operations Research, Systems Engineering and Industrial Engineering | Transportation
Information Systems and Management
Naval Research Logistics
BISH, Ebru K.; LEONG, Thin Yin; LI, C. L.; 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. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/5