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.