智能选线系统的离散时间近似优化算法

He Wang, Weile Chen, Haibo Du
{"title":"智能选线系统的离散时间近似优化算法","authors":"He Wang, Weile Chen, Haibo Du","doi":"10.1109/IAI53119.2021.9619242","DOIUrl":null,"url":null,"abstract":"In this paper, the discrete-time optimization problem for transmission line planning for power systems is studied, in which the local cost function is considered. Firstly, a global cost function is constructed by using penalty function method. Secondly, for the optimization problem of intelligent line selection system, a discrete-time optimization algorithm is proposed. In the optimization algorithm design, the gradient of approximate cost function is used. In the proposed algorithm, the global optimal advantage of each sub-stage is selected, and the optimal advantage can be adjusted by penalty parameters. Compared with the traditional optimization algorithm, the convergence time and accuracy are improved. Finally, the example simulation results verify the effectiveness and superiority of the proposed discrete-time optimization algorithm.","PeriodicalId":106675,"journal":{"name":"2021 3rd International Conference on Industrial Artificial Intelligence (IAI)","volume":"80 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Discrete-Time Approximate Optimization Algorithm for Intelligent Line Selection System\",\"authors\":\"He Wang, Weile Chen, Haibo Du\",\"doi\":\"10.1109/IAI53119.2021.9619242\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the discrete-time optimization problem for transmission line planning for power systems is studied, in which the local cost function is considered. Firstly, a global cost function is constructed by using penalty function method. Secondly, for the optimization problem of intelligent line selection system, a discrete-time optimization algorithm is proposed. In the optimization algorithm design, the gradient of approximate cost function is used. In the proposed algorithm, the global optimal advantage of each sub-stage is selected, and the optimal advantage can be adjusted by penalty parameters. Compared with the traditional optimization algorithm, the convergence time and accuracy are improved. Finally, the example simulation results verify the effectiveness and superiority of the proposed discrete-time optimization algorithm.\",\"PeriodicalId\":106675,\"journal\":{\"name\":\"2021 3rd International Conference on Industrial Artificial Intelligence (IAI)\",\"volume\":\"80 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 3rd International Conference on Industrial Artificial Intelligence (IAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAI53119.2021.9619242\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 3rd International Conference on Industrial Artificial Intelligence (IAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAI53119.2021.9619242","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了考虑局部代价函数的电力系统输电线路规划离散优化问题。首先,利用罚函数法构造全局代价函数;其次,针对智能选线系统的优化问题,提出了离散时间优化算法。在优化算法设计中,采用了近似代价函数的梯度。该算法选取各子阶段的全局最优优势,并通过惩罚参数对最优优势进行调整。与传统的优化算法相比,提高了收敛时间和精度。最后,算例仿真结果验证了所提离散时间优化算法的有效性和优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Discrete-Time Approximate Optimization Algorithm for Intelligent Line Selection System
In this paper, the discrete-time optimization problem for transmission line planning for power systems is studied, in which the local cost function is considered. Firstly, a global cost function is constructed by using penalty function method. Secondly, for the optimization problem of intelligent line selection system, a discrete-time optimization algorithm is proposed. In the optimization algorithm design, the gradient of approximate cost function is used. In the proposed algorithm, the global optimal advantage of each sub-stage is selected, and the optimal advantage can be adjusted by penalty parameters. Compared with the traditional optimization algorithm, the convergence time and accuracy are improved. Finally, the example simulation results verify the effectiveness and superiority of the proposed discrete-time optimization algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on self-maintenance strategy of CNC machine tools based on case-based reasoning An Improved RRT* Algorithm Combining Motion Constraint and Artificial Potential Field for Robot-Assisted Flexible Needle Insertion in 3D Environment Relative Stability Analysis Method of Systems Based on Goal Seek Operation Optimization of Park Integrated Energy System Considering the Response of Electricity and Cooling Demand Privacy-Preserving Push-sum Average Consensus Algorithm over Directed Graph Via State Decomposition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1