Heuristic algorithm for retrieving containers
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Yongmin | - |
dc.contributor.author | Kim, Taeho | - |
dc.contributor.author | Lee, HongChul | - |
dc.date.accessioned | 2021-09-03T17:45:16Z | - |
dc.date.available | 2021-09-03T17:45:16Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2016-11 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/87067 | - |
dc.description.abstract | This study proposes a heuristic algorithm to achieve efficient container retrieval given a specified order, by minimizing the number of container movements and the working time of the crane. We evaluated our proposed algorithm by solving 70 sample problems. The results confirmed the validity and efficiency of the algorithm compared to methods used in previous research. Our algorithm succeeds in reducing the number of container movements and the working time of the crane. Furthermore, the heuristic algorithm is computationally efficient and greatly reduces the amount of time required to obtain a solution. Therefore, we expect our heuristic to be useful in the real-world industry where rapid decision making is required. (C) 2016 Published by Elsevier Ltd. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | ROUTING ALGORITHM | - |
dc.subject | TRANSFER CRANE | - |
dc.subject | NUMBER | - |
dc.title | Heuristic algorithm for retrieving containers | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, HongChul | - |
dc.identifier.doi | 10.1016/j.cie.2016.08.022 | - |
dc.identifier.scopusid | 2-s2.0-84989829886 | - |
dc.identifier.wosid | 000390497900028 | - |
dc.identifier.bibliographicCitation | COMPUTERS & INDUSTRIAL ENGINEERING, v.101, pp.352 - 360 | - |
dc.relation.isPartOf | COMPUTERS & INDUSTRIAL ENGINEERING | - |
dc.citation.title | COMPUTERS & INDUSTRIAL ENGINEERING | - |
dc.citation.volume | 101 | - |
dc.citation.startPage | 352 | - |
dc.citation.endPage | 360 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.subject.keywordPlus | ROUTING ALGORITHM | - |
dc.subject.keywordPlus | TRANSFER CRANE | - |
dc.subject.keywordPlus | NUMBER | - |
dc.subject.keywordAuthor | Container retrieval | - |
dc.subject.keywordAuthor | Heuristic | - |
dc.subject.keywordAuthor | Container terminal | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.