Multi Resource Scheduling Problem Based on an Improved Discrete Particle Swarm Optimization

摘要：

A primary goal for terminals is to minimize turnaround time of ships. The optimization scheduling of Quay Cranes (QCs) can significantly reduce the turnaround time of a ship. This paper proposes a model of quay crane scheduling for discharging operations in container terminals and attempts to apply an improved discrete Particle Swarm Optimization algorithm to solve this problem. The improved PSO uses a priority mapping method to generate the proper scheduling sequence. This paper introduces the concept of swarm distance to add swarm diversity. When the swarm distance reaches a threshold value, the position of particles should be re-assigned randomly. The results of simulation optimization experiments suggest that the improved discrete PSO algorithm in this paper is well suited for quay crane scheduling in practice in container terminals.

关键词： Particle Swarm Optimization Scheduling Problem Container Terminal

作者: Su Wang Jun Zheng Kai Zheng Jun Guo Xiaoping Liu

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

会议类型: 国际会议

会议名称: 2010 Second Asia-Pacific Conference on Information Processing(2010年第二届亚太地区信息处理国际会议 APCIP 2010)

会议地点: 南昌

会议语种:英文

页码: 427-430

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