基于改进蚁群算法的运输调度规划.pdfVIP

25 4 Vol25 o4 2008 4 Journal of Highway andTransportation Research and Development Apr2008 :(2008) 张志霞, 邵必林 ( , 710055) : 在运输调度等组合优化问题的最优路线的搜索中, 传统蚁群算法ACA (Ant Colony Algorithm) 存在搜索时间长 收敛 度慢易陷于局部最优解等缺点为了克服这些缺点提出了一种改进的蚁群算法, 该算法将遗传算法和蚁群算 法结合起来, 在蚁群算法的每 一次迭代过程中, 首先采用自适应策略控制它的收敛 度, 然后使用变异操作来确定解 值, 从而提高它的搜索性能再结合建立的运输调度性能指标, 利用遗传算法蚁群算法和改进蚁群算法3 种方法分 别进行运输规划, 通过比较其时间花费和运输费用, 验证了改进蚁群算法的有效性实践证明, 改进后的蚁群算法基 本上克服了传统算法自身的不足, 提高了算法性能 : 交通工程; 运输调度规划; 蚁群算法; 车辆 + : U4924 12 : A Vehicle Routing and Scheduling Problems Based on Improved ACA ZHA G Zhixia, SHAO Bilin (School of Management, Xi anUniversity of Architecture Technology, Xi an Shaanxi 710055, China) Abstract: Basic ant colony algorithm (ACA) has many shortages when it is used for searching the best route of combinatorial optimization problems including VRSP, such as long searching time, slow convergence rate and easily limited to local optimal solution, etcThe improved ant colony algorithm, which integrates the ant colony algorithmwith thegenetic algorithm,was proposed to overcome these shortcomings and improve its performanceIn each iteration of the ant colony algorithm, adaptive evaporating coefficient was selected to control the convergence rate at first, and then the exact solutionwas determined by the operations of mutationAt last by demonstrating the power of this approach on atest case, the results derived from the genetic algorithm, basicACA and the improved ACA were compared and analyzed in the experimentIt proved that the improved ant colony algorithm is effective Key words: traffi