Particle Swarm Optimization in Solving Vehicle Routing Problem
The Vehicle Routing Problem (VRP) is a NP complete problem and is also a hot topic in the operational research.But traditional methods might suffer from slow convergence and the curse of large sizes,heuristicsbased swarm intelligence can be an efficient alternative.Particle swarm optimization(PSO)is known to effectively solve engineering optimization problems.In this paper,the PSO in solving VRP is comprehensive surveyed from two basic aspects:the improved PSO algorithms and the particle encoding method.For each application,technical details that are required are all discussed.Finally,a summary is given together with suggestions for future research.
Vehicle Routing Problem(VRP) Particle Swarm Optimization(PSO) distrete optimization encoding
Hai Shen Ting Liu Yunlong Zhu Li Jin
Key Laboratory of Industrial Informatics Shenyang Institute of Automation, Chinese Academy of Scienc Department of Automatic Control School of Information Science and Engineering,Northeastern Universit Key Laboratory of Industrial Informatics Shenyang Institute of Automation, Chinese Academy of Scienc Key Laboratory of Industrial Informaties Shenyang Institute of Automation, Chinese Academy of Scienc
国际会议
长沙
英文
287-291
2009-10-10(万方平台首次上网日期,不代表论文的发表时间)