配电网重构遗传算法的不可行解问题研究  

Study on Infeasible Solution of Distribution Network Reconfiguration Genetic Algorithm

作　　者：黄彦浩[1] 李晓明[1] 

机构地区：[1]武汉大学,武汉市430072

出　　处：《电力建设》2004年第3期23-27,共5页Electric Power Construction

摘　　要：不可行解是遗传算法应用于配电网重构时遇到的一个难题。文章介绍了配电网重构遗传算法不可行解的含义 ,讨论了不可行解产生的原因和危害 ,并针对遗传操作过程中可能产生不可行解的各个环节 ,讨论了交叉操作、突变操作和倒位操作等解决方案 ,认为这些方案可以有效地减少或控制不可行解 。When genetic algorithm (GA) is used to solve the problems of distribu tion network reconfiguration, the infeasible solution will become a difficult pr oblem. The paper introduces its meanings and discusses the reasons of its appear ance and harms. The paper also discusses the solution in crossover, mutation and inversion operations, pointing to every step of inheritance operation in which infeasible solution may appear. By means of the solution the search efficiency o f GA will be improved.

关 键 词：城市配电网 网络重构 遗传算法 搜索效率 

分 类 号：TM727.2[电气工程—电力系统及自动化]