A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds

作者：Rodriguez Molins Mario^*; Salido Miguel A; Barber Federico

来源：Applied Intelligence, 2014, 40(2): 273-290.

DOI：10.1007/s10489-013-0462-4

• Planning
• Scheduling
• Optimization methods
• Algorithms
• Metaheuristic
• GRASP

Container terminals are open systems that generally serve as a transshipment zone between vessels and land vehicles. These terminals carry out a large number of planning and scheduling tasks. In this paper, we consider the problem of scheduling a number of incoming vessels by assigning a berthing position, a berthing time, and a number of Quay Cranes to each vessel. This problem is known as the Berth Allocation Problem and the Quay Crane Assignment Problem. Holds of vessels are also managed in order to obtain a more realistic approach. Our aim is to minimize the total waiting time elapsed to serve all these vessels. In this paper, we deal with the above problems and propose an innovative metaheuristic approach. The results are compared against other allocation methods.

• 出版日期2014-3