Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals

Basit Öğe Kaydı
dc.authorid0000-0001-6466-8331en_US
dc.authorid0000-0002-1485-730Xen_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:40Z
dc.date.available2024-07-12T21:46:40Z
dc.date.issued2016en_US
dc.departmentMaltepe Üniversitesien_US
dc.description.abstractThere has been a dramatic increase in world's container traffic during the last thirty years. As a consequence, the efficient management of container terminals has become a crucial issue. In this work we concentrate on the integrated seaside operations, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. First, we formulate a mixed-integer linear program whose exact solution gives optimal berthing positions and berthing times of the vessels, along with their crane schedules during their stay at the quay. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assigned number of cranes in each time period in a master problem, and seeks the corresponding optimal crane schedule by solving a subproblem. We prove that the crane scheduling subproblem is NP-complete under general cost settings, but can be solved in polynomial time for certain special cases. Our computational study shows that our new formulation and proposed solution method yield optimal solutions for realistic-sized instances. (C) 2016 Elsevier B.V. All rights reserved.en_US
dc.description.sponsorshipIBM [W1056865]; Turkish Scientific and Technological Council (TUBITAK) [213M441]en_US
dc.description.sponsorshipWe gratefully acknowledge the support of IBM through an open collaboration research award #W1056865 granted to the third author and partial support of the Turkish Scientific and Technological Council (TUBITAK) with Grant no. 213M441. We also would like to send our gratitude to the anonymous referees for their comments and suggestions they made on the previous versions.en_US
dc.identifier.doi10.1016/j.ejor.2016.04.022
dc.identifier.endpage1001en_US
dc.identifier.issn0377-2217
dc.identifier.issn1872-6860
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-84967105997en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage985en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.ejor.2016.04.022
dc.identifier.urihttps://hdl.handle.net/20.500.12415/7953
dc.identifier.volume254en_US
dc.identifier.wosWOS:000378663000025en_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.snmzKY00865
dc.subjectInteger programmingen_US
dc.subjectContainer terminal managementen_US
dc.subjectBerth allocationen_US
dc.subjectCrane assignmenten_US
dc.subjectCrane schedulingen_US
dc.titleOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminalsen_US
dc.typeArticle
dspace.entity.typePublication

Dosyalar

Koleksiyon

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