File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Yard planning for vessel services with a cyclical calling pattern

TitleYard planning for vessel services with a cyclical calling pattern
Authors
Keywordscontainer terminal
cyclical service
heuristic
yard planning
yard template
Issue Date2010
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0305215x.asp
Citation
Engineering Optimization, 2010, v. 42 n. 11, p. 1039-1054 How to Cite?
AbstractIn a land-scarce container terminal, congestions in the terminal yard due to highly concentrated workload often lead to unsatisfactory terminal productivity. Currently, yard planners use their experience to design a yard template for determining the storage locations of export containers to be loaded onto vessels deployed to services with a cyclical calling pattern. This article studies the problem of designing a yard template that balances the workload in an export yard. The template design problem is formulated as an integer program. It is found that the computational time required to optimally solve realistic sizes of the template design problem is unacceptably long. This article proposes a simpler integer program as an approximate model. On the basis of the analysis on the approximate model, a heuristic is developed to solve the template design problem. Results of computational experiments show that the heuristic can find effective solutions for the template design problem © 2010 Taylor & Francis.
Persistent Identifierhttp://hdl.handle.net/10722/135131
ISSN
2015 Impact Factor: 1.38
2015 SCImago Journal Rankings: 0.866
ISI Accession Number ID
Funding AgencyGrant Number
Hong Kong Research Grants Council715508
Funding Information:

The author would like to thank his former colleagues in PSA Corporation, Singapore, and Dr. Lai of Hongkong International Terminals Limited for many useful discussions. This research was supported by Hong Kong Research Grants Council General Research Fund (#715508).

References

 

DC FieldValueLanguage
dc.contributor.authorNg, WCen_HK
dc.contributor.authorMak, KLen_HK
dc.contributor.authorLi, MKen_HK
dc.date.accessioned2011-07-27T01:28:44Z-
dc.date.available2011-07-27T01:28:44Z-
dc.date.issued2010en_HK
dc.identifier.citationEngineering Optimization, 2010, v. 42 n. 11, p. 1039-1054en_HK
dc.identifier.issn0305-215Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/135131-
dc.description.abstractIn a land-scarce container terminal, congestions in the terminal yard due to highly concentrated workload often lead to unsatisfactory terminal productivity. Currently, yard planners use their experience to design a yard template for determining the storage locations of export containers to be loaded onto vessels deployed to services with a cyclical calling pattern. This article studies the problem of designing a yard template that balances the workload in an export yard. The template design problem is formulated as an integer program. It is found that the computational time required to optimally solve realistic sizes of the template design problem is unacceptably long. This article proposes a simpler integer program as an approximate model. On the basis of the analysis on the approximate model, a heuristic is developed to solve the template design problem. Results of computational experiments show that the heuristic can find effective solutions for the template design problem © 2010 Taylor & Francis.en_HK
dc.languageengen_US
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0305215x.aspen_HK
dc.relation.ispartofEngineering Optimizationen_HK
dc.subjectcontainer terminalen_HK
dc.subjectcyclical serviceen_HK
dc.subjectheuristicen_HK
dc.subjectyard planningen_HK
dc.subjectyard templateen_HK
dc.titleYard planning for vessel services with a cyclical calling patternen_HK
dc.typeArticleen_HK
dc.identifier.emailNg, WC:ngwc@hkucc.hku.hken_HK
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_HK
dc.identifier.authorityNg, WC=rp00160en_HK
dc.identifier.authorityMak, KL=rp00154en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1080/03052151003650092en_HK
dc.identifier.scopuseid_2-s2.0-77958167762en_HK
dc.identifier.hkuros186191en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77958167762&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume42en_HK
dc.identifier.issue11en_HK
dc.identifier.spage1039en_HK
dc.identifier.epage1054en_HK
dc.identifier.isiWOS:000283058000004-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridNg, WC=7401613494en_HK
dc.identifier.scopusauthoridMak, KL=7102680226en_HK
dc.identifier.scopusauthoridLi, MK=36616331900en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats