计算机技术与发展Issue(8)：119-122,127,5.DOI:10.3969/j.issn.1673-629X.2015.08.025
带时间窗车辆路径问题的混沌粒子群优化算法
A Chaos Particle Swarm Optimization Algorithm of Vehicle Routing Problem with Time Windows
摘要
Abstract
The vehicle routing problem is a NP complete problem and is also a hot topic in the operational research field. Many people do research on it,but searching efficiency and the rate of success are low and the cost is high. In view of this,based on basic PSO algorithm is easy to fall into local optimum,and chaos has many characteristics such as randomicity,ergodicity and regularity,combined the particle optimization algorithm with chaos optimization algorithm in this paper,a chaos particle swarm optimization algorithm is proposed,and ap-plied to the Vehicle Routing Problem with Time Windows ( VRPTW) . Through simulation experiments,the chaotic Particle Swarm Opti-mization ( PSO) algorithm and PSO algorithm,genetic algorithm and other algorithms are compared. The experimental results show that the chaotic particle swarm optimization arithmetic with fast speed and good robustness,can obtain high quality of the solution,which is a simple and effective algorithm to solve the vehicle routing problem with time windows.关键词
混沌/粒子群/车辆问题/混沌粒子群优化算法Key words
chaos/particle swarm/vehicle problems/chaos particle swarm optimization algorithm分类
信息技术与安全科学引用本文复制引用
杨庆,陈强,李珍珍..带时间窗车辆路径问题的混沌粒子群优化算法[J].计算机技术与发展,2015,(8):119-122,127,5.基金项目
上海市教育创新项目理科重点项目(12ZZ182) （12ZZ182）
