计算机工程2011，Vol.37Issue(24)：190-192,3.DOI:10.3969/j.issn.1000-3428.2011.24.063
混合蚁群算法在车辆路径问题中的应用
Application of Hybrid Ant Colony Algorithm in Vehicle Routing Problem
摘要
Abstract
Ant Colony Algorithm(ACA) has some short-comings such as its slow computing speed, and it is easy to fall in a local optimal. Based on the idea of ACA, a hybrid optimization algorithm for solving Vehicle Routing Problem(VRP) is proposed. The algorithm expands the scope of solution space and improves the global ability of the algorithm by importing mutation operator, optimizes the stage optimal solution further by combining 2-opt, and controls the rate of change in pheromone by adjusting configuration of parameters dynamically. Example simulation results show that this algorithm can get optimal resolution of VRP effectively and quickly.关键词
车辆路径问题/混合蚁群算法/变异算子/线路改进/动态规划Key words
Vehicle Routing Problem(VRP)/ hybrid Ant Colony Algorithm(ACA)/ mutation operator/ line improvement/ dynamic programming分类
信息技术与安全科学引用本文复制引用
张潇,王江晴..混合蚁群算法在车辆路径问题中的应用[J].计算机工程,2011,37(24):190-192,3.基金项目
国家自然科学基金资助项目"复杂环境下动态车辆路径问题的建模与优化"(60842004) （60842004）
