Abstract
Abstract 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
