{"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}
引用次数: 0
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.