摘要
车辆路径问题(VRP)是一类物流配送领域具有广泛应用的组合优化问题,属于NP难题。一种改进的蚁群优化算法可以用于求解VRP。实验结果表明,采用蚁群优化算法能有效求解VRP问题。
Vehicle routing problem （VRP）, which belongs to NP problems, is a typical combinational optimization problem widely utilized in logistic distribution. Therefore, this paper puts forward an improved ant colony optimization （ACO） algorithm to solve VRP. Thus, a VRP based on ACO algorithm is implemented. Results of the experiment prove the effectiveness of ACO algorithm in solving VRP.
出处
《廊坊师范学院学报（自然科学版）》
2011年第6期30-31,35,共3页
Journal of Langfang Normal University(Natural Science Edition)
关键词
车辆路径问题
物流配送
蚁群优化算法
信息素
vehicle routing problem
logistic distribution
ant colony optimization （ACO） algorithm
pheromone
