Particle Swarm Optimization and Simulated Annealing-Based Algorithms for Berth Allocation Problem

摘要：

This paper considers the berth allocation problem with the objective of minimizing total service time, including vessels waiting time. A new hybrid algorithm is developed in this paper to solve the problem. In the hybrid algorithm, discrete particle swarm optimization combines global search and local search to search for the optimal results and simulated annealing uses certain probability to avoid being trapped in local optimum. The computational result showed that the proposed algorithm is a feasible and effective approach for berth allocation problem.

关键词： Berth Allocation Scheduling Particle Swarm Optimization Simulated Annealing

作者: Yuan Chen Jun Zheng Su Wang

作者单位: Computer Center East China Normal University Shanghai China

会议类型: 国际会议

会议名称: 2010 International Conference on Circuit and Signal Processing(2010年电路与信号处理国际会议 ICCSP 2010)

会议地点: 上海

会议语种:英文

页码: 270-273

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