Premium
Analysis of a new vehicle scheduling and location problem
Author(s) -
Bish Ebru K.,
Leong ThinYin,
Li ChungLun,
Ng Jonathan W. C.,
SimchiLevi David
Publication year - 2001
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.1024
Subject(s) - yard , container (type theory) , computer science , terminal (telecommunication) , heuristic , scheduling (production processes) , operations research , job shop scheduling , mathematical optimization , engineering , computer network , mathematics , artificial intelligence , mechanical engineering , physics , routing (electronic design automation) , quantum mechanics
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. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001