An integrated method for berth allocation and quay crane assignment to allow for reassignment of vessels to other terminals
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, Sung Won | - |
dc.contributor.author | Park, Hyun Ji | - |
dc.contributor.author | Lee, Chulung | - |
dc.date.accessioned | 2021-11-23T22:40:51Z | - |
dc.date.available | 2021-11-23T22:40:51Z | - |
dc.date.created | 2021-08-30 | - |
dc.date.issued | 2021-03 | - |
dc.identifier.issn | 1479-2931 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/128527 | - |
dc.description.abstract | With globalization increasing countries' trade volumes, resource management at container terminals has become more complex. To realistically address this problem, this paper proposes a methodology to solve the berth allocation and quay crane assignment problem (BACAP) while allowing the reassignment of vessels to other terminals in a multiuser container terminal. A filtered beam search (FBS)-based heuristic, a greedy randomized adaptive search procedure (GRASP)-based heuristic, and an iterative approach are integrated to provide a solution within a reasonable time frame. Numerical experiments are conducted with realistic instances from a container terminal located in Busan, Republic of Korea. The results show that the proposed approach yields a near-optimal solution with a significantly shorter computational time, compared with a commercial solver. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | PALGRAVE MACMILLAN LTD | - |
dc.subject | CONTAINER TERMINALS | - |
dc.subject | BEAM SEARCH | - |
dc.subject | HEURISTICS | - |
dc.subject | ALGORITHM | - |
dc.subject | MODELS | - |
dc.title | An integrated method for berth allocation and quay crane assignment to allow for reassignment of vessels to other terminals | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Chulung | - |
dc.identifier.doi | 10.1057/s41278-020-00173-4 | - |
dc.identifier.scopusid | 2-s2.0-85093854338 | - |
dc.identifier.wosid | 000595460300001 | - |
dc.identifier.bibliographicCitation | MARITIME ECONOMICS & LOGISTICS, v.23, no.1, pp.123 - 153 | - |
dc.relation.isPartOf | MARITIME ECONOMICS & LOGISTICS | - |
dc.citation.title | MARITIME ECONOMICS & LOGISTICS | - |
dc.citation.volume | 23 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 123 | - |
dc.citation.endPage | 153 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | ssci | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Transportation | - |
dc.relation.journalWebOfScienceCategory | Transportation | - |
dc.subject.keywordPlus | CONTAINER TERMINALS | - |
dc.subject.keywordPlus | BEAM SEARCH | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | MODELS | - |
dc.subject.keywordAuthor | Container terminals | - |
dc.subject.keywordAuthor | Berth allocation problem (BAP) | - |
dc.subject.keywordAuthor | Quay crane assignment problem (QCAP) | - |
dc.subject.keywordAuthor | Filtered beam search (FBS) | - |
dc.subject.keywordAuthor | Greedy randomized adaptive search procedure (GRASP) | - |
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.