检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《航空计算技术》2005年第4期103-106,共4页Aeronautical Computing Technique
摘 要:对于旅行商问题的研究始于19世纪,从20世纪中叶开始随着计算机技术的发展而不断发展。蚁群算法是一种新型的优化算法,于20世纪90年代提出,最早成功应用于解决旅行商问题。研究表明,蚁群算法有着极强的鲁棒性发现较好解的能力。通过编程实现了用蚁群算法解决旅行商问题,通过仿真实验研究了各参数对算法的影响。Study on TSP begun at early 1800s'aud it had been developing continuously with the development of computer technology since 1950s'. Ant colony algorithm is a new kind of optimization algorithm ; it was firstly brought forward in 1990s'and was applied in TSP successfully. It has been proved that it is a robust algorithm and has the powerful ability to find more preferable solutions. Programming is done to realize TSP based on ant colony algorithm. The effects that the parameters of the algorithm have on the algorithm have been researched through simulation and repeated experiments.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15