Model and Algorithm for the Berth Allocation Problem with Time Windows

摘要：

The berth allocation problem studies the optimal scheduling of assigning arrival ships to berths along a quay in container terminals. The objective is to minimize the total service time for all ships in the planning horizon. The time window constraints on the service time of ships and the available time of berth are considered in this paper. And a new model and a heuristic based on the Tabu Search algorithm are developed for this berth allocation problem with time windows. We conduct eight computational experiments which showed that the proposed algorithm is adaptable to the real world application. And for larger sizes it is always better than the CPLEX on computational time. So this method may be helpful in the efficient management of busy terminals during extreme peaking conditions.

关键词： berth allocation container terminal optimal model time windows tabu search

作者: QIN Jin MIAO Li-xin SHI Feng CHEN Chang-bin

作者单位: Research Center for Logistics,Graduate School at Shenzhen,Tsinghua University,Shenzhen 518055;School Research Center for Logistics,Graduate School at Shenzhen,Tsinghua University,Shenzhen 518055 School of Traffic and Transportation Engineering,CentralSouth University,Changsha,410075

会议类型: 国际会议

会议名称: 2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)

会议地点: 广西桂林

会议语种:英文

页码: 4947-4950

在线出版日期: 2009-06-17（万方平台首次上网日期，不代表论文的发表时间）