背包问题的混合遗传算法解法在电力系统恢复中的应用

计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (6): 206-209.

背包问题的混合遗传算法解法在电力系统恢复中的应用

刘敏忠张志毅张玉萍

武汉大学计算机学院计算机应用系软件工程国家重点实验室武汉大学计算机学院

收稿日期:2006-03-16 修回日期:1900-01-01 出版日期:2007-02-21 发布日期:2007-02-21
通讯作者: 刘敏忠

A Hybrid Genetic Algorithm For Knapsack Problem And Its Application In Power System Restoration

MinZhong Liu

Received:2006-03-16 Revised:1900-01-01 Online:2007-02-21 Published:2007-02-21
Contact: MinZhong Liu

摘要/Abstract

摘要： 文章把电力系统的负荷恢复问题建模为带众多约束条件的0-1背包问题，并设计了一种将贪心算法与改进遗传算法结合起来的改进混合遗传算法来对此问题进行求解。该算法的主要特点是具有群体爬山性和利用了郭涛算子的非凸组合技术使算法具有搜索的遍历性。采用本文的算法可以得到负荷恢复的某一阶段可恢复的最大的负荷量。求解的过程保证了求得的解是满足系统的约束条件的，所以系统的负荷恢复过程是安全的。算例的结果表明了该算法的有效性。

Abstract: The article established the optimization model for the load restoration, a zero-one knapsack problem with many safe constraints, and designed a modified hybrid genetic algorithm which combined the greedy algorithm and modified genetic algorithm together to resolve it. The main character of the algorithm is its colony mountain climbing and because of the no protruding combination technology of guotao operator the algorithm had the characters of global searching. By using this algorithm the maximal restorable loads at one of the stages of the load restoration can be gotten. The process of power system restoration is safe because the algorithm guaranteed that the constraint conditions were satisfied. The experiment on a 26-node system was presented and the results show that the algorithm is feasible.

刘敏忠张志毅张玉萍. 背包问题的混合遗传算法解法在电力系统恢复中的应用[J]. 计算机工程与应用, 2007, 43(6): 206-209.

MinZhong Liu. A Hybrid Genetic Algorithm For Knapsack Problem And Its Application In Power System Restoration[J]. Computer Engineering and Applications, 2007, 43(6): 206-209.