File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Scheduling yard crane in a port container terminal using genetic algorithm

TitleScheduling yard crane in a port container terminal using genetic algorithm
Authors
KeywordsContainer Terminal
Genetic Algorithm
Yard Crane Scheduling
Issue Date2006
PublisherInternational Journal of Industrial Engineering. The Journal's web site is located at http://www.ijienet.org
Citation
International Journal Of Industrial Engineering : Theory Applications And Practice, 2006, v. 13 n. 3, p. 246-253 How to Cite?
AbstractIt is well known that yard operation is the heart of the entire terminal as the efficiency of yard operations determines that of the overall terminal operations. To achieve smooth flow of containers in a yard, yard cranes need to be positioned at the right location at the right time to pickup containers from or load containers onto trucks. This research studies the problem of scheduling a yard crane to perform a given set of container handling jobs with different ready times to minimize the sum of job waiting times. It is shown that the problem is NP-complete. An algorithm is developed to find a lower bound for the optimal solution of the scheduling problem and genetic algorithm (GA) approach is proposed to find an effective yard crane schedule. Five popular crossover schemes are considered in this paper. The performance of GA with the five crossover schemes are evaluated on a comprehensive set of test problems which are randomly generated based on realistic yard operations data. The computational results show that the GA approach can indeed find effective solutions for the scheduling problem. Significance: The current practice of scheduling yard came in port container terminals often lead to trucks queuing up at yard blocks. The paper proposes to use GA approach to find an effective yard crane schedule to reduce the sum of truck waiting times. © INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING.
Persistent Identifierhttp://hdl.handle.net/10722/155897
ISSN
2008 Impact Factor: 0.123
2015 SCImago Journal Rankings: 0.247
References

 

DC FieldValueLanguage
dc.contributor.authorNg, WCen_US
dc.contributor.authorMak, KLen_US
dc.contributor.authorTsang, WSen_US
dc.date.accessioned2012-08-08T08:38:15Z-
dc.date.available2012-08-08T08:38:15Z-
dc.date.issued2006en_US
dc.identifier.citationInternational Journal Of Industrial Engineering : Theory Applications And Practice, 2006, v. 13 n. 3, p. 246-253en_US
dc.identifier.issn1072-4761en_US
dc.identifier.urihttp://hdl.handle.net/10722/155897-
dc.description.abstractIt is well known that yard operation is the heart of the entire terminal as the efficiency of yard operations determines that of the overall terminal operations. To achieve smooth flow of containers in a yard, yard cranes need to be positioned at the right location at the right time to pickup containers from or load containers onto trucks. This research studies the problem of scheduling a yard crane to perform a given set of container handling jobs with different ready times to minimize the sum of job waiting times. It is shown that the problem is NP-complete. An algorithm is developed to find a lower bound for the optimal solution of the scheduling problem and genetic algorithm (GA) approach is proposed to find an effective yard crane schedule. Five popular crossover schemes are considered in this paper. The performance of GA with the five crossover schemes are evaluated on a comprehensive set of test problems which are randomly generated based on realistic yard operations data. The computational results show that the GA approach can indeed find effective solutions for the scheduling problem. Significance: The current practice of scheduling yard came in port container terminals often lead to trucks queuing up at yard blocks. The paper proposes to use GA approach to find an effective yard crane schedule to reduce the sum of truck waiting times. © INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING.en_US
dc.languageengen_US
dc.publisherInternational Journal of Industrial Engineering. The Journal's web site is located at http://www.ijienet.orgen_US
dc.relation.ispartofInternational Journal of Industrial Engineering : Theory Applications and Practiceen_US
dc.subjectContainer Terminalen_US
dc.subjectGenetic Algorithmen_US
dc.subjectYard Crane Schedulingen_US
dc.titleScheduling yard crane in a port container terminal using genetic algorithmen_US
dc.typeArticleen_US
dc.identifier.emailNg, WC:ngwc@hkucc.hku.hken_US
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_US
dc.identifier.authorityNg, WC=rp00160en_US
dc.identifier.authorityMak, KL=rp00154en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-34047153903en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-34047153903&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume13en_US
dc.identifier.issue3en_US
dc.identifier.spage246en_US
dc.identifier.epage253en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridNg, WC=7401613494en_US
dc.identifier.scopusauthoridMak, KL=7102680226en_US
dc.identifier.scopusauthoridTsang, WS=36805810300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats