Chaos Particle Swarm Optimization for Resource Allocation Problem

摘要

Speed is extremely important in container terminals. Faced with the increasing growth of container throughput and larger container ships, a key factor of success is to generate the best resource allocation plan to improve the efficiency of container terminals. Due to the easy implementation and effectiveness of Particle Swarm Optimization (PSO), this paper presents a new Chaos PSO method for resource allocation problem in the container terminal system. Chaos Search can get all the states in the search space by the rules of itself and generate neighborhoods of near-optimal solutions to maintain solution diversity. Embedding Chaos Search as a local search method into PSO can prevent the search process from becoming premature. This paper examines the performance of tugboat allocation optimization in container terminals and gets satisfactory results.