### Study on multi-depots vehicle routing problem based on improved particle swarm optimization

WANG Tiejun1, WU Kaijun2

1. 1.School of Mathematics and Computer Science, Northwest University for Nationalities, Lanzhou 730030, China
2.School of Electronic and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China
• Online:2013-01-15 Published:2013-01-16

### 多车场车辆路径问题的改进粒子群算法

1. 1.西北民族大学 数学与计算机科学学院，兰州 730030
2.兰州交通大学 电子与信息工程学院，兰州 730070

Abstract: Multi-Depots Vehicle Routing Problem（MDVRP） is a kind of NP combination problem which possesses important practical value. In order to overcome PSO’s premature and slow convergence, a new improved algorithm is put forward, it adopts co-evolutionary thought and at the same time pattern search method is introduced while the search falling into local optimum. In this paper, a kind of new particles coding method is constructed and the solution algorithm is developed. The simulation results show that the algorithm has better optimal speed and optimal efficiency than GA and PSO, so it proves the algorithm used to optimize MDVRP is feasible and effective.