考虑系统损耗的输电网扩展规划自适应差分进化算法

T. Sum-Im, W. Ongsakul
{"title":"考虑系统损耗的输电网扩展规划自适应差分进化算法","authors":"T. Sum-Im, W. Ongsakul","doi":"10.1109/PECON.2012.6450196","DOIUrl":null,"url":null,"abstract":"In this paper, a self-adaptive differential evolution algorithm (SaDEA) is applied directly to the DC power flow based model in order to efficiently solve transmission network expansion planning (TNEP) problem. The purpose of TNEP is to minimize the transmission investment cost associated with the technical operation and economical constraints. The TNEP problem is a large-scale, complex and nonlinear combinatorial problem of mixed integer nature where the number of candidate solutions to be evaluated increases exponentially with system size. In addition, the TNEP problem with system losses consideration is also investigated in this paper. The efficiency of the proposed method is initially demonstrated via the analysis of low and medium complexity transmission network test cases. A detailed comparative study among conventional genetic algorithm (CGA), tabu search (TS), artificial neural networks (ANNs), hybrid artificial intelligent techniques and the proposed method is presented. From the obtained experimental results, the proposed technique provides the accurate solution, the feature of robust computation, the simple implementation and the satisfactory computational time.","PeriodicalId":135966,"journal":{"name":"2012 IEEE International Conference on Power and Energy (PECon)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A self-adaptive differential evolution algorithm for transmission network expansion planning with system losses consideration\",\"authors\":\"T. Sum-Im, W. Ongsakul\",\"doi\":\"10.1109/PECON.2012.6450196\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a self-adaptive differential evolution algorithm (SaDEA) is applied directly to the DC power flow based model in order to efficiently solve transmission network expansion planning (TNEP) problem. The purpose of TNEP is to minimize the transmission investment cost associated with the technical operation and economical constraints. The TNEP problem is a large-scale, complex and nonlinear combinatorial problem of mixed integer nature where the number of candidate solutions to be evaluated increases exponentially with system size. In addition, the TNEP problem with system losses consideration is also investigated in this paper. The efficiency of the proposed method is initially demonstrated via the analysis of low and medium complexity transmission network test cases. A detailed comparative study among conventional genetic algorithm (CGA), tabu search (TS), artificial neural networks (ANNs), hybrid artificial intelligent techniques and the proposed method is presented. From the obtained experimental results, the proposed technique provides the accurate solution, the feature of robust computation, the simple implementation and the satisfactory computational time.\",\"PeriodicalId\":135966,\"journal\":{\"name\":\"2012 IEEE International Conference on Power and Energy (PECon)\",\"volume\":\"132 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Conference on Power and Energy (PECon)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PECON.2012.6450196\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Power and Energy (PECon)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PECON.2012.6450196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文将自适应差分进化算法(SaDEA)直接应用于基于直流潮流的模型中,以有效地解决输电网扩展规划问题。TNEP的目的是使与技术运行和经济约束相关的输电投资成本最小化。TNEP问题是一个具有混合整数性质的大规模、复杂和非线性组合问题,待评估的候选解的数量随着系统规模的增加呈指数增长。此外,本文还研究了考虑系统损耗的TNEP问题。通过对中低复杂度传输网络测试用例的分析,初步验证了该方法的有效性。对传统遗传算法(CGA)、禁忌搜索(TS)、人工神经网络(ANNs)、混合人工智能技术与该方法进行了详细的比较研究。实验结果表明,该方法解准确,计算鲁棒,实现简单,计算时间短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A self-adaptive differential evolution algorithm for transmission network expansion planning with system losses consideration
In this paper, a self-adaptive differential evolution algorithm (SaDEA) is applied directly to the DC power flow based model in order to efficiently solve transmission network expansion planning (TNEP) problem. The purpose of TNEP is to minimize the transmission investment cost associated with the technical operation and economical constraints. The TNEP problem is a large-scale, complex and nonlinear combinatorial problem of mixed integer nature where the number of candidate solutions to be evaluated increases exponentially with system size. In addition, the TNEP problem with system losses consideration is also investigated in this paper. The efficiency of the proposed method is initially demonstrated via the analysis of low and medium complexity transmission network test cases. A detailed comparative study among conventional genetic algorithm (CGA), tabu search (TS), artificial neural networks (ANNs), hybrid artificial intelligent techniques and the proposed method is presented. From the obtained experimental results, the proposed technique provides the accurate solution, the feature of robust computation, the simple implementation and the satisfactory computational time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信