期刊文献+

基于遗传算法的城市输电网络巡视路径优化选择问题 被引量:5

Optimization patrol route selection problem for city transmission network based on genetic algorithm
下载PDF
导出
摘要 为了保障输电网络的安全稳定运行,降低电网故障概率,优化输电网络日常管理,基于实际调研获得输电网络的加权网络图,考虑输电网络巡视消耗成本、机会成本、风险成本,根据实际巡航问题的约束条件和效用最大化的目标函数建立数学模型。提出了基于输电网络巡视路线优化的遗传算法设计,通过与改进的Dijkstra算法相比较,提出的算法具有计算复杂度低、准确率高、鲁棒性强的特点。针对有关输电网络日常巡视管理优化问题的探讨,对于提升电网应急响应速度、提高电网可靠性、降低成本、提高效率有十分重要的意义。 Weighted network diagram for transmission network was obtained based on practical investigation, which consider- ing the costs of fuel consumption, opportunity and risks, this paper proposed a mathematical model for patrol route based on actual constraint conditions and objective function for utility maximum. It gave the genetic algorithm of the patrol route selec- tion problem for city transmission network, by comparing genetic algorithm with the modified Dijkstra algorithm, found that the genetic algorithm had lower time-complexity, higher accuracy rate and stronger robustness. Probing into the optimization of the daily inspections route for transmission network is an effective way to enhance the speed of emergency responding and service quality, to cut down the cost of management and to improve efficiency.
出处 《计算机应用研究》 CSCD 北大核心 2013年第8期2276-2279,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(70732003) 国家电网公司总部直管项目(52095012008P)
关键词 输电网络 路线优化 遗传算法 transmission network route optimization genetic algorithm
  • 相关文献

参考文献18

  • 1ARABANI A B, FARAHANI R Z. Facility location dynamics: an overview of classifications and applications [ J]. Computers & In- dustrial Engineering,2012,62( 1 ) : 408-420. 被引量:1
  • 2FARAHANI R Z, ASGARI N, HEIDARI N, et al. Covering prob- lems in facility location: a review [ J]. Computers & Industrial En- gineering, 2012,62( 1 ) : 368-407. 被引量:1
  • 3KEPAPTSOGLOU K, KARLAFTIS M. Transit route network design problem: review [ J]. Journal of Transportation Engineering, 2009,135(8) : 491-505. 被引量:1
  • 4WANG Ze, MA Shi-yong, AN Shi. A dynamic emergency evacuation network optimization problem with crossing elimination strategy [ J ]. Advanced Engineering Forum,2012,5:32-37. 被引量:1
  • 5GAO Yuan. Shortest path problem with uncertain arc lengths [ J ]. Computers & Mathematics with Applications, 2011,62 ( 6 ) : 2591 - 2600. 被引量:1
  • 6GUPTA M, AGGARWAL C, HAN Jia-wei. Finding top-k shortest path distance changes in an evolutionary network [ J ]. Advances in Spatial and Temporal Databases. Berlin: Springer-Verlag,2011:130- 148. 被引量:1
  • 7SU Bing, HUA Chun-yan, LAN Xiao-yi, et al. Computing the criti- cal road section for the repair of a transportation network [ J ]. Sys- tems Engineering Procedia,2012 ,5 :173-178. 被引量:1
  • 8XU Yin-feng, YAN Hua-hai. Real time critical edge of the shortest path in transportation networks [ C ]//Proc of the 3rd International Conference on Theory and Applications of Models of Computation. Berlin: Springer-Verlag, 2006 : 198- 205. 被引量:1
  • 9刘明,徐寅峰,杜源江,肖鹏.不完全信息下交通网络的关键路径问题[J].系统工程,2006,24(12):16-20. 被引量:16
  • 10苏兵,徐寅峰,肖鹏.交通网络最优安全路径选择模型与算法[J].西安交通大学学报,2008,42(4):395-398. 被引量:11

二级参考文献51

共引文献122

同被引文献40

引证文献5

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部