计算机应用研究2012，Vol.29Issue(4)：1253-1255,3.DOI:10.3969/j.issn.1001-3695.2012.04.014
基于粒子碰撞的粒子群算法求解带时间窗车辆调度问题
Based on particles collision PSO for vehicle routing problem with time windows
摘要
Abstract
The vehicle routing problem with time windows (VRPTW) is the NP-hard combinatorial optimization discrete problem. There was certain inferiority performance on solving it with traditional PSO, so this paper proposed a particles collision discrete PSO to solve it. Inspired by the physical phenomena of the velocity and position changed after objects collision, it made the current particle collided with the personal best particle and global best particle to avoid the tradition rounding operating in updating, and kept particles swarm evolutional capability. It used the Solomon' s VRP instance to test. The results of experiments show that the algorithm has good performance.关键词
带时间窗车辆调度问题/粒子碰撞/离散粒子群算法Key words
vehicle routing problem with time windows (VRPTW)/ particles collision/ discrete PSO分类
信息技术与安全科学引用本文复制引用
秦家娇,张勇,毛剑琳,付丽霞..基于粒子碰撞的粒子群算法求解带时间窗车辆调度问题[J].计算机应用研究,2012,29(4):1253-1255,3.基金项目
云南省应用基础研究基金资助项目(2009ZC050M) （2009ZC050M）
云南省教育厅科学研究基金资助项目(08Y0093) （08Y0093）
