摘要
【目的】以供水特点为基础建立相应的数学模型,优化选择供水中的管网路径。【方法】利用改进的蚁群算法,对供水管网进行优化选择,在选择策略上,以初始节点引入的虚拟路径距离为基础,对启发信息进行归一化处理,并利用全局策略进行优选节点的概率选择;在更新策略上,利用信息素的局部和全局更新,并结合蚂蚁数量自适应调整及增加随机干扰进行改进;最后以巴家咀水库为对象,利用基本蚁群算法和改进蚁群算法进行优化计算并比较。【结果】利用改进的蚁群算法进行计算时,所得的平均路径、最短路径、最差路径、平均迭代次数和总成本分别为139.635 5km、138.214 7km、142.301 9km、314次和11.32亿元,而基本蚁群算法分别为145.042 1km、140.582 7km、149.215 5km、638次和11.51亿元,改进蚁群算法各项计算指标均优于基本蚁群算法。【结论】改进的蚁群算法可以提高全局搜索能力和收敛速度,能快速有效地获得供水路径的最优解或近似最优解,可以为管道供水路径的优化选择提供参考。
[Objective] Based on characteristics of water supply,a mathematical model using improved ant colony algorithm was established to optimize the water supply network. [Method] Using improved ant colony algorithm, optimization of water supply pipe network was conducted. For strategy selection, the sys- tem was based on the introduced virtual path distance to the initial node and probability selection using global strategy. For update strategy,local and global pheromone updates were used in combination with a- daptive adjustment of the ants＇ number and random interference. At last,the established model was applied in Bajiazui reservoir. [Result] The improved ant colony algorithm was better than basic ant colony algo- rithm. The average path, the shortest path, the worst path, the average iteration number and total cost were improved from 145. 042 1 km, 140. 582 7 km, 149. 215 5 km, 638 times and 1. 151 billion ￥ to 139. 635 5 km,138. 214 7 km, 142. 301 9 km,314 and 1. 132 billion ￥,respectively. [Conclusion] The improved algo- rithm provided better results by improving the global search ability and convergence speed.
出处
《西北农林科技大学学报（自然科学版）》
CSCD
北大核心
2014年第1期228-234,共7页
Journal of Northwest A&F University(Natural Science Edition)
基金
国家自然科学基金项目(51079120,50979088)
陕西省国际合作重点项目(2008KW-32)
关键词
水资源开发
供水管道
管网优化
改进蚁群算法
巴家咀水库
water resources development
supply pipe
pipe network optimization
improved ant colonyalgorithm
Bajiazui reservoir
