Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (27): 200-202.DOI: 10.3778/j.issn.1002-8331.2009.27.061

• 工程与应用 • Previous Articles     Next Articles

Improved Particle Swarm Optimization for Vehicle Routing Problem with time windows

MA Xuan,PENG Peng,LIU Qing   

  1. School of Automation and Information Engineering,Xi’an University of Technology,Xi’an 710048,China
  • Received:2009-03-23 Revised:2009-06-01 Online:2009-09-21 Published:2009-09-21
  • Contact: MA Xuan

求解带时间窗车辆路径问题的改进粒子群算法

马 炫,彭 芃,刘 庆   

  1. 西安理工大学 自动化与信息工程学院,西安 710048
  • 通讯作者: 马 炫

Abstract: Through analysing the reason that the existing particle swarm optimization algorithms can not find good solutions of solving the vehicle routing problem with tim windows,this paper proposes a method of updating integer particle based on transposition.The algorithm that consists of double-layer Particle Swarm Optimization(PSO) is tested on the problem instances of 8 and 20 mission points,respectively.The numerical simmulation results show that the proposed algorithm is superior to the existing algorithms in searching high quality solutions and time-consuming.

Key words: Vehicle Routing Problem(VRP) with time windows, Particle Swarm Optimization(PSO), principle of transposition

摘要: 通过分析已有粒子群算法对有时间窗约束的车辆路径问题求解质量不高的原因,提出了一种基于粒子交换原理的整数粒子更新方法。采用构造的双层粒子进化算法分别对8个和20个任务点的有时间窗约束的车辆路径问题求解,数值实验结果表明算法的求解精度和耗时均优于已有算法。

关键词: 带时间窗车辆路径问题, 粒子群算法, 交换原理

CLC Number: