A modified genetic algorithm for optimal electrical distribution network reconfiguration

The 2003 Congress on Evolutionary Computation, 2003. CEC '03. Pub Date : 2003-12-08 DOI:10.1109/CEC.2003.1299844

B. Radha, R. King, H. Rughooputh

{"title":"A modified genetic algorithm for optimal electrical distribution network reconfiguration","authors":"B. Radha, R. King, H. Rughooputh","doi":"10.1109/CEC.2003.1299844","DOIUrl":null,"url":null,"abstract":"Network reconfiguration in distribution systems is realised by changing the status of sectionalizing switches and is usually done for loss reduction. The distribution reconfiguration belongs to a complex combinatorial optimization problem. This is because there are multiple constraints, which must not be violated while finding an optimal or near-optimal solution to the distribution network reconfiguration problem. An exhaustive search can definitely find the optimal solution but is computationally intensive. Moreover, solution produced by other heuristic search techniques often produce local optima. Consequently, to solve the problem with implementation simplicity, computation efficiency, solution feasibility and optimality, an improved method based on a modified genetic algorithm (GA) with real valued genes and an adaptive mutation rate is used. The distribution network reconfiguration (DNRC) model, in which the objective is to minimize the system power loss, is presented in this paper with application to 16-bus, 33-bus systems and a real distribution network of Mauritius.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299844","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 31

Abstract

Network reconfiguration in distribution systems is realised by changing the status of sectionalizing switches and is usually done for loss reduction. The distribution reconfiguration belongs to a complex combinatorial optimization problem. This is because there are multiple constraints, which must not be violated while finding an optimal or near-optimal solution to the distribution network reconfiguration problem. An exhaustive search can definitely find the optimal solution but is computationally intensive. Moreover, solution produced by other heuristic search techniques often produce local optima. Consequently, to solve the problem with implementation simplicity, computation efficiency, solution feasibility and optimality, an improved method based on a modified genetic algorithm (GA) with real valued genes and an adaptive mutation rate is used. The distribution network reconfiguration (DNRC) model, in which the objective is to minimize the system power loss, is presented in this paper with application to 16-bus, 33-bus systems and a real distribution network of Mauritius.

查看原文本刊更多论文

配电网优化重构的改进遗传算法

配电系统中的网络重构是通过改变分网开关的状态来实现的，通常是为了减少损耗。分布重构属于一个复杂的组合优化问题。这是因为在寻找配电网重构问题的最优或接近最优解决方案时，存在多个约束，不能违反这些约束。穷举搜索肯定能找到最优解，但计算量很大。此外，其他启发式搜索技术产生的解往往产生局部最优。因此，为了使问题实现简单、计算效率高、解可行且最优，采用了一种基于实数基因和自适应突变率的改进遗传算法(GA)。本文以毛里求斯16总线、33总线系统和实际配电网为例，提出了以系统功率损耗最小为目标的配电网重构模型。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

The 2003 Congress on Evolutionary Computation, 2003. CEC '03.

自引率

0.00%

发文量