{"title":"The Edge-set Encoding in Evolutionary Algorithms for Power Distribution Network Planning Problem Part I: Single-objective Optimization Planning","authors":"F. Rivas-Dávalos, M. Irving","doi":"10.1109/CERMA.2006.90","DOIUrl":null,"url":null,"abstract":"In this paper we propose representing solutions in evolutionary algorithms for power distribution network expansion planning problems using the edge-set encoding technique, and we describe recombination and mutation operators for this representation. We demonstrate the usefulness of this encoding technique in a genetic algorithm designed to deal with the planning problem formulated as a single-objective optimization problem: to find the best location and size of substations and lines to minimize a cost function of the network. The algorithm was tested on a real power distribution network and the results were compared with the results from other heuristic methods. We concluded that the edge-set encoding and its genetic operators in evolutionary algorithms for power distribution network expansion planning offer strong locality and heritability, and computational efficiency. In the companion paper, the edge-set encoding technique is tested on a multi-objective power distribution network planning problem","PeriodicalId":179210,"journal":{"name":"Electronics, Robotics and Automotive Mechanics Conference (CERMA'06)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronics, Robotics and Automotive Mechanics Conference (CERMA'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CERMA.2006.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
In this paper we propose representing solutions in evolutionary algorithms for power distribution network expansion planning problems using the edge-set encoding technique, and we describe recombination and mutation operators for this representation. We demonstrate the usefulness of this encoding technique in a genetic algorithm designed to deal with the planning problem formulated as a single-objective optimization problem: to find the best location and size of substations and lines to minimize a cost function of the network. The algorithm was tested on a real power distribution network and the results were compared with the results from other heuristic methods. We concluded that the edge-set encoding and its genetic operators in evolutionary algorithms for power distribution network expansion planning offer strong locality and heritability, and computational efficiency. In the companion paper, the edge-set encoding technique is tested on a multi-objective power distribution network planning problem