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.
An integrated method for berth allocation and quay crane assignment to allow for reassignment of vessels to other terminals
Marit Econ Logist
Maritime Economics & Logistics ; 23 , 1 ; 123-153
2021-03-01
31 pages
Article (Journal)
Electronic Resource
English
Berth Allocation and Crane Assignment Problem in Continuous Berth Containers Vessels Terminals
DOAJ | 2022
|