摘要
电网规划是一个较难解决的NP难问题。文中首先就遗传算法、禁忌搜索算法(TS)及其两者的混合算法在旅行商问题(TSP)中的应用来比较它们之间的优缺点,认为采用了TS变异算子的改进遗传算法将大大提高其优化能力;然后通过该混合算法在典型电网扩展规划算例中的应用来看,认为该混合算法适用于求解复杂的电网规划问题;最后通过对该混合算法在求解实际的城市中压配电网络规划问题时与其他两种单一算法的结果比较来看,其搜索效率相比单一算法得到了很大程度的提高,体现了很好的应用前景。
Power network planning is a NP hard problem difficult to be solved. First, by comparing the different abilities when solving TSP by the genetic algorithm (GA), Tabu search (TS) and the hybrid algorithm of the two, this paper proves the advantages of improved GA adopting the TS mutation operation. Then, the improved GA, viz. genetic Tabu hybrid algorithm (GTHA), has proved suitable for optimizing the complex power network planning via its application in a typical example of power network expansion planning. Finally, while optimizing the actual urban mid-voltage distribution network planning using GA, TS and GTHA respectively, the comparison results show that the search efficiency of GTHA is much better than the other two and GTHA proposed in this paper has a promising application.
出处
《电力系统自动化》
EI
CSCD
北大核心
2004年第20期43-46,62,共5页
Automation of Electric Power Systems
关键词
遗传算法
禁忌搜索算法
混合算法
电网扩展规划
配电网络规划
genetic algorithm
Tabu search
hybrid algorithm
power network expansion planning
distribution network planning
