计算机工程与应用Issue(13)：17-20,4.DOI:10.3778/j.issn.1002-8331.1301-0363
基于改进差分进化的车辆路径优化算法
Vehicle Routing Problem algorithm based on improved differential evolution
摘要
Abstract
As a new kind of evolutionary algorithm, Differential Evolution(DE)algorithm with the characteristics of remembering individual optimal solution and information sharing can be regarded as a real coded and excellent security greedy genetic algo-rithm. To solve the Vehicle Routing Problem(VRP), which belongs to NP problems, the paper puts forward an improved differ-ential evolution algorithm. A greedy algorithm is used to generate the initial population, legalized method is used to repair muta-tion, improved order crossover is used, then, after the mutation operator, a new selection mechanism is added in. The new algo-rithm is implemented in Matlab, the experimental results show that the improved differential evolution algorithm can efficiently solve the VRP.关键词
差分进化算法/车辆路径问题/贪心算法/NP问题/进化算法Key words
Differential Evolution(DE)/Vehicle Routing Problem(VRP)/greedy algorithm/NP problem/evolutionary algorithm分类
信息技术与安全科学引用本文复制引用
邬开俊,王铁君..基于改进差分进化的车辆路径优化算法[J].计算机工程与应用,2013,(13):17-20,4.基金项目
国家社科基金（No.12CGL004）；兰州交通大学青年科学研究基金（No.2011005）。 （）
