检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]巢湖学院,安徽巢湖238000
出 处:《巢湖学院学报》2016年第3期10-17,共8页Journal of Chaohu University
基 金:巢湖学院自然科学研究资助项目(项目编号:XLY-201114);安徽省自然科学基金项目(项目编号:1308085MF101);计算机科学与技术省级特色专业(项目编号:2013tszy020);省级教研项目(项目编号:2014jyxm331);基于项目驱动的软件信息类人才培养模式创新实验区(项目编号:ch12syq02)
摘 要:针对蚁群算法在求解优化组合问题时存在收敛速度较慢,搜索时间较长且易于陷入局部最优解等缺点,提出了一种改进的蚁群算法,从信息素初始量,路径选择机制和信息素更新三个方面进行改进并将新算法应用到求解环巢湖地区自驾游路线问题中。实验结果表明,改进的算法行之有效,收敛次数和最优解较基本蚁群算法都有所提高,并且提出了具体自驾游路线以供参考。Ant colony algorithm has a slow convergence speed in solving the optimization problem and the search time is long and it tends to fall into local optimal solution. Aimed at such shortcomings, an improved ant colony algorithm is proposed. The new algorithm is improved from the three aspects of initial pheromone amount, path selection mechanism and pheromone update. It is applied to solve the problem of self-driving tour in Chaohu Lake area. The experimental results show that the improved algorithm is effective to solve the problem. The number of convergence and the optimal solution are improved compared with the basic ant colony algorithm. Specific self-driving tour route is also put forward for reference.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.188