Optimal berth allocation and time-invariant quay crane assignment in container terminals

Basit Öğe Kaydı
dc.authorid0000-0002-1485-730Xen_US
dc.authorid0000-0002-9904-4315en_US
dc.contributor.authorTurkogullari, Yavuz B.
dc.contributor.authorTaskin, Z. Caner
dc.contributor.authorAras, Necati
dc.contributor.authorAltinel, I. Kuban
dc.date.accessioned2024-07-12T21:46:39Z
dc.date.available2024-07-12T21:46:39Z
dc.date.issued2014en_US
dc.departmentMaltepe Üniversitesien_US
dc.description.abstractDue to the dramatic increase in the world's container traffic, the efficient management of operations in seaport container terminals has become a crucial issue. In this work, we focus on the integrated planning of the following problems faced at container terminals: berth allocation, quay crane assignment (number), and quay crane assignment (specific). First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment (number) problems called BACAP. Then we extend it by incorporating the quay crane assignment (specific) problem as well, which is named BACASP. Computational experiments performed on problem instances of various sizes indicate that the model for BACAP is very efficient and even large instances up to 60 vessels can be solved to optimality. Unfortunately, this is not the case for BACASP. Therefore, to be able to solve large instances, we present a necessary and sufficient condition for generating an optimal solution of BACASP from an optimal solution of BACAP using a post-processing algorithm. In case this condition is not satisfied, we make use of a cutting plane algorithm which solves BACAP repeatedly by adding cuts generated from the optimal solutions until the aforementioned condition holds. This method proves to be viable and enables us to solve large BACASP instances as well. To the best of our knowledge, these are the largest instances that can be solved to optimality for this difficult problem, which makes our work applicable to realistic problems. (C) 2013 Elsevier B.V. All rights reserved.en_US
dc.description.sponsorshipIBM [W1056865]en_US
dc.description.sponsorshipWe gratefully acknowledge the support of IBM through an open collaboration research award #W1056865 granted to the third author. We also would like to thank two anonymous reviewers for their comments and suggestions that improved the content and presentation style of the paper.en_US
dc.identifier.doi10.1016/j.ejor.2013.10.015
dc.identifier.endpage101en_US
dc.identifier.issn0377-2217
dc.identifier.issn1872-6860
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-84895058952en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage88en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.ejor.2013.10.015
dc.identifier.urihttps://hdl.handle.net/20.500.12415/7952
dc.identifier.volume235en_US
dc.identifier.wosWOS:000346319100008en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoenen_US
dc.publisherELSEVIER SCIENCE BVen_US
dc.relation.ispartofEUROPEAN JOURNAL OF OPERATIONAL RESEARCHen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmzKY00864
dc.subjectBerth allocationen_US
dc.subjectCrane assignmenten_US
dc.subjectContainer terminalsen_US
dc.subjectCutting plane algorithmen_US
dc.titleOptimal berth allocation and time-invariant quay crane assignment in container terminalsen_US
dc.typeArticle
dspace.entity.typePublication

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu