摘要
本文将具有强约束的网络资源均衡与优化问题转化为组合优化的最短路问题 ,利用遗传算法快速全局的搜索能力 ,生成初始解 ,并转化为网络的初始信息素分布。利用蚂蚁算法的正反馈特性 ,迅速收敛到问题的最优解。仿真表明取得了非常好的效果。
First, the paper changes the constraint problem of the network resources balance and optimizing into the shortest path problem on combinatorial optimization. Second, it adopts genetic algorithm to solve and to give information pheromone to distribute and make use of it's ability of quickness and stochastic on a globally searching. Third, it gives the well solution makes use of the characteristics of ant algorithm converges on optimization pass information pheromone accumulation and renew. Finally, the simulation results show the very nice effect.
出处
《仪器仪表学报》
EI
CAS
CSCD
北大核心
2003年第z1期592-594,598,共4页
Chinese Journal of Scientific Instrument
基金
国家自然科学基金 ( 60 1740 2 1)
天津自然科学重点基金 ( 0 13 80 0 711)
河南科技攻关 ( 0 12 414 0 14 1)资助项目
关键词
混合蚂蚁算法
网络资源优化
Combination of genetic algorithm and ant algorithm Network resource optimizing