摘要
针对带时间窗车辆路径问题(Vehicle Routing Problem with Time Windows,VRPTW)的特点,对蚁群算法进行了改进,优化了其搜索解的能力和收敛速度,用实例证明了改进的蚁群算法对解决VRPTW的有效性.
Based on the characteristics of Vehicle Routing Problem with Time Windows （VRPTW）, an improved Ant Colony Algorithm is proposed in this paper, the ability of finding efficient solutions and the convergence speed are optimized with this algorithm, and the computational experiment demonstrates that the improved algorithm is efficient to the VRPTW.
出处
《重庆工学院学报》
2007年第11期50-52,共3页
Journal of Chongqing Institute of Technology
