配电网规划问题进化算法中的边集编码。第一部分:单目标优化规划

F. Rivas-Dávalos, M. Irving
{"title":"配电网规划问题进化算法中的边集编码。第一部分:单目标优化规划","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":"{\"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}","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

摘要

本文提出了用边集编码技术表示配电网扩展规划问题的进化算法解,并描述了这种表示的重组算子和突变算子。我们在遗传算法中展示了这种编码技术的有用性,该算法被设计用于处理规划问题,该问题被表述为一个单目标优化问题:找到变电站和线路的最佳位置和大小,以最小化网络的成本函数。在实际配电网上对该算法进行了测试,并与其他启发式算法的结果进行了比较。结果表明,配电网扩展规划进化算法中的边集编码及其遗传算子具有较强的局部性和遗传性,计算效率较高。本文在多目标配电网规划问题上对边缘集编码技术进行了测试
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Edge-set Encoding in Evolutionary Algorithms for Power Distribution Network Planning Problem Part I: Single-objective Optimization Planning
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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信