Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
Küçük Resim Yok
Tarih
2016
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
ELSEVIER SCIENCE BV
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
There 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.
Açıklama
Anahtar Kelimeler
Integer programming, Container terminal management, Berth allocation, Crane assignment, Crane scheduling
Kaynak
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
254
Sayı
3
