计算机应用研究2018，Vol.35Issue(3)：666-670,5.DOI:10.3969/j.issn.1001-3695.2018.03.006
带时间窗车辆路径问题的分布式多agent蚁群算法
Distributed multiagent-based ant colony algorithm for vehicle routing problem with time windows
摘要
Abstract
Because of the disadvantage in the previous research of the vehicle routing problem with time windows (VRPTW),like limited solving efficiency,limited complexity,and difficulty to solve large-scale problems,this paper proposed a distributed multi agent ant colony algorithm which aimed at improving the accuracy and speed of the algorithm.Based on the traditional ant colony algorithm,this paper improved the state transition rule and combined the neighborhood search algorithm to improve the accuracy.At the same time,it designed the algorithm as a distributed structure to improve the speed.So,it could utilize multi agent distributed system to distributed solve the VRPTW problem.The results of four experiments which designed for the international standard show that this algorithm has obvious advantages in accuracy,speed,reliability and solving largescale problems.This research provides a new idea and a feasible method for solving large-scale and complex VRPTW problems.关键词
带时间窗车辆路径问题/蚁群算法/分布式算法/代理Key words
vehicle routing problem with time windows(VRPTW)/ant colony algorithm/distributed algorithm/agent分类
信息技术与安全科学引用本文复制引用
金淳,张雨,王聪..带时间窗车辆路径问题的分布式多agent蚁群算法[J].计算机应用研究,2018,35(3):666-670,5.基金项目
国家自然科学基金资助项目(71271041) （71271041）
