Analysis of a new vehicle scheduling and location problem

Ebru K. Bish; Thin-Yin Leong; Chung-Lun Li; Jonathan W. C. Ng; David Simchi-Levi

doi:10.1002/nav.1024

Analysis of a new vehicle scheduling and location problem

Ebru K. Bish, Thin-Yin Leong, Chung-Lun Li, Jonathan W. C. Ng, David Simchi-Levi

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

129 Citations (Scopus)

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.

Original language	English
Pages (from-to)	363-385
Journal	Naval Research Logistics
Volume	48
Issue number	5
DOIs	https://doi.org/10.1002/nav.1024
Publication status	Published - Aug 2001
Externally published	Yes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Access Output

10.1002/nav.1024

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{da0df37b20e042c8bcbf94f8147cb744,

title = "Analysis of a new vehicle scheduling and location problem",

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.",

author = "Bish, {Ebru K.} and Thin-Yin Leong and Chung-Lun Li and Ng, {Jonathan W. C.} and David Simchi-Levi",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "2001",

month = aug,

doi = "10.1002/nav.1024",

language = "English",

volume = "48",

pages = "363--385",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley & Sons",

number = "5",

}

TY - JOUR

T1 - Analysis of a new vehicle scheduling and location problem

AU - Bish, Ebru K.

AU - Leong, Thin-Yin

AU - Li, Chung-Lun

AU - Ng, Jonathan W. C.

AU - Simchi-Levi, David

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2001/8

Y1 - 2001/8

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

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

UR - http://www.scopus.com/inward/record.url?scp=0035426438&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0035426438&origin=recordpage

U2 - 10.1002/nav.1024

DO - 10.1002/nav.1024

M3 - RGC 21 - Publication in refereed journal

SN - 0894-069X

VL - 48

SP - 363

EP - 385

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 5

ER -

Analysis of a new vehicle scheduling and location problem

Abstract

Bibliographical note

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this