关键词: 多车辆拖动货物问题, 粒子群优化算法, 模拟退火算法, 空间约束, 数学模型, 调度

Abstract: In order to determine sequences and vehicles of containers to their goal locations, multiple vehicle dragging goods problem was put forward. Influence of space constraint on vehicle scheduling process should be considered in this problem. Aiming at this problem, an integer programming model for the problem was established, and it was proved to be NP complete hard. To solve this problem, four kinds of coding methods were proposed. Hybrid particle swarm alogirthm was used to solve this problem by integrating simulated annealing algorithm with particle swarm algorithm. And the performance of the hybrid particle swarm algorithm was compared to the simulated annealing algorithm and the particle swarm algorithm. The computational results showed that the two chromosome representation using the first-come-first-served rule was more effective than other three representations in resolving the problem.

Key words: multiple vehicle dragging goods problem, particle swarm optimization algorithm, simulated annealing algorithm, space constraint, mathematical models, scheduling