关键词: 扫描算法, 粒子群算法, 遗传算法, 车辆路径问题

Abstract: In order to escape local optimum for particle swarm optimization algorithm to solve the vehicle routing problem, this paper proposes a sweep-particle swarm optimization algorithm. It uses the sweep algorithm to get initial feasible solution by sweeping each mineral occurrence. The initial feasible solution is substituted as the particle’s initial position to search into particle swarm. The paper gets the particle swarm history optimal position, which is reversed transcription to the corresponding feasible solution. The vehicle routing problem of Zhengzhou Coal Electricity Material Supply and Marketing Limited Company is solved through the improved swarm optimization algorithm. The sweep-particle swarm optimization algorithm is applied to contrast with classical particle swarm optimization and genetic algorithm, and the result of emulated experiment makes clear that the sweep-particle swarm optimization algorithm is a fast and exact algorithm.

Key words: sweep algorithm, particle swarm optimization, genetic algorithm, vehicle routing problem