File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Scheduling yard crane in a port container terminal using genetic algorithm
Title | Scheduling yard crane in a port container terminal using genetic algorithm |
---|---|
Authors | |
Keywords | Container Terminal Genetic Algorithm Yard Crane Scheduling |
Issue Date | 2006 |
Publisher | International 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? |
Abstract | It 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 Identifier | http://hdl.handle.net/10722/155897 |
ISSN | 2023 Impact Factor: 1.2 2023 SCImago Journal Rankings: 0.200 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ng, WC | en_US |
dc.contributor.author | Mak, KL | en_US |
dc.contributor.author | Tsang, WS | en_US |
dc.date.accessioned | 2012-08-08T08:38:15Z | - |
dc.date.available | 2012-08-08T08:38:15Z | - |
dc.date.issued | 2006 | en_US |
dc.identifier.citation | International Journal Of Industrial Engineering : Theory Applications And Practice, 2006, v. 13 n. 3, p. 246-253 | en_US |
dc.identifier.issn | 1072-4761 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155897 | - |
dc.description.abstract | It 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.language | eng | en_US |
dc.publisher | International Journal of Industrial Engineering. The Journal's web site is located at http://www.ijienet.org | en_US |
dc.relation.ispartof | International Journal of Industrial Engineering : Theory Applications and Practice | en_US |
dc.subject | Container Terminal | en_US |
dc.subject | Genetic Algorithm | en_US |
dc.subject | Yard Crane Scheduling | en_US |
dc.title | Scheduling yard crane in a port container terminal using genetic algorithm | en_US |
dc.type | Article | en_US |
dc.identifier.email | Ng, WC:ngwc@hkucc.hku.hk | en_US |
dc.identifier.email | Mak, KL:makkl@hkucc.hku.hk | en_US |
dc.identifier.authority | Ng, WC=rp00160 | en_US |
dc.identifier.authority | Mak, KL=rp00154 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-34047153903 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-34047153903&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 13 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.spage | 246 | en_US |
dc.identifier.epage | 253 | en_US |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Ng, WC=7401613494 | en_US |
dc.identifier.scopusauthorid | Mak, KL=7102680226 | en_US |
dc.identifier.scopusauthorid | Tsang, WS=36805810300 | en_US |
dc.identifier.issnl | 1072-4761 | - |