摘要
描述了连接增强问题的实质,提出了基于蚂蚁算法求解连接增强问题的算法,针对如何处理约束条件提出了两种不同的策略。通过模拟实验证明了算法的可行性,评价了算法的性能,讨论了参数的设定,最后比较了两种不同策略的性能。
Compare with the essential of Traveling Salesman Problem（TSP） and Link Enhancement Problem.We present a solution for Link Enhancement Problem based on ant algorithm.To deal with the restriction condition,we propose two different kinds of strategies.By the simulation experiment,the algorithm is proved to be feasible.With the result of simulation experiment,we analyze the enactment of the parameters ,and compare the performance of the two strategies.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第11期125-127,131,共4页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60673163
No.60473085)
国家重点基础研究发展规划(973)(the National Grand Fundamental Research 973 Program of China under Grant No.2003CB314804)。
关键词
网络拓扑结构
蚂蚁算法
连接增强
topology structure expansion
ant algorithm
link enhancement
