File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Analysing a new vehicle scheduling and location problem

TitleAnalysing a new vehicle scheduling and location problem
Authors
Issue Date2001
PublisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://as.wiley.com/WileyCDA/WileyTitle/productCd-NAV.html
Citation
Naval Research Logistics, 2001, v. 48 n. 5, p. 363-385 How to Cite?
AbstractWe 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
Persistent Identifierhttp://hdl.handle.net/10722/74342
ISSN
2015 Impact Factor: 0.787
2015 SCImago Journal Rankings: 1.134

 

DC FieldValueLanguage
dc.contributor.authorBish, EK-
dc.contributor.authorLeong, TY-
dc.contributor.authorLi, CL-
dc.contributor.authorNg, JWC-
dc.contributor.authorSimchi-Levi, D-
dc.date.accessioned2010-09-06T07:00:24Z-
dc.date.available2010-09-06T07:00:24Z-
dc.date.issued2001-
dc.identifier.citationNaval Research Logistics, 2001, v. 48 n. 5, p. 363-385-
dc.identifier.issn0894-069X-
dc.identifier.urihttp://hdl.handle.net/10722/74342-
dc.description.abstractWe 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-
dc.languageeng-
dc.publisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://as.wiley.com/WileyCDA/WileyTitle/productCd-NAV.html-
dc.relation.ispartofNaval Research Logistics-
dc.rightsNaval Research Logistics. Copyright © John Wiley & Sons, Inc.-
dc.rightsSpecial Statement for Preprint only Before publication: 'This is a preprint of an article accepted for publication in [The Journal of Pathology] Copyright © ([year]) ([Pathological Society of Great Britain and Ireland])'. After publication: the preprint notice should be amended to follows: 'This is a preprint of an article published in [include the complete citation information for the final version of the Contribution as published in the print edition of the Journal]' For Cochrane Library/ Cochrane Database of Systematic Reviews, add statement & acknowledgement : ‘This review is published as a Cochrane Review in the Cochrane Database of Systematic Reviews 20XX, Issue X. Cochrane Reviews are regularly updated as new evidence emerges and in response to comments and criticisms, and the Cochrane Database of Systematic Reviews should be consulted for the most recent version of the Review.’ Please include reference to the Review and hyperlink to the original version using the following format e.g. Authors. Title of Review. Cochrane Database of Systematic Reviews 20XX, Issue #. Art. No.: CD00XXXX. DOI: 10.1002/14651858.CD00XXXX (insert persistent link to the article by using the URL: http://dx.doi.org/10.1002/14651858.CD00XXXX) (This statement should refer to the most recent issue of the Cochrane Database of Systematic Reviews in which the Review published.)-
dc.titleAnalysing a new vehicle scheduling and location problem-
dc.typeArticle-
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0894-069X&volume=48&spage=363&epage=385&date=2001&atitle=Analysing+a+new+vehicle+scheduling+and+location+problemen_HK
dc.identifier.emailNg, JWC: ngwc@hkucc.hku.hk-
dc.identifier.authorityNg, JWC=rp00160-
dc.identifier.doi10.1002/nav.1024-
dc.identifier.hkuros71277-
dc.identifier.volume48-
dc.identifier.issue5-
dc.identifier.spage363-
dc.identifier.epage385-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats