改进猴群算法在输电网扩展规划中的应用

Application of Improved Monkey Algorithm in Transmission Network Expansion Planning

对猴群算法进行了改进,引入支路搜索权数来反应不同支路消除系统过负荷能力的大小,并以之为方向重新设计了爬过程,有效地解决了原猴群算法求解电网规划问题时爬过程失效的问题;同时引入望过程参数递增机制,提高了算法后期的收敛速度。通过对18节点和46节点系统的计算,证明了算法求解输电网扩展规划问题的正确性和有效性。

In view of the limitations of MA,the Improved Monkey Algorithm（IMA） has been proposed for transmission expansion network planning.This paper also introduces an indicator called branch searching weight to measure the ability in eliminating the overflow of the system between different branches.Based on this indicator,a new climbing process has been designed to tackle the problem of invalid climbing process in transmission network expansion planning.Increasing parameters mechanism has also been introduced into the algorithm to accelerate the convergence speed.The correctness and effectiveness of IMA have been verified by the calculation results of 18-bus system and Brazilian South 46-bus system.