Alessandro Francesco Castelli , Iiro Harjunkoski , Jan Poland , Marco Giuntoli , Emanuele Martelli , Ignacio E. Grossmann
{"title":"解决安全受限的单位承诺问题:三种新方法","authors":"Alessandro Francesco Castelli , Iiro Harjunkoski , Jan Poland , Marco Giuntoli , Emanuele Martelli , Ignacio E. Grossmann","doi":"10.1016/j.ijepes.2024.110213","DOIUrl":null,"url":null,"abstract":"<div><div>This work proposes three novel approaches to speed up the solution of the Security Constrained Unit Commitment problem: an improvement of an active-set iterative approach taken from literature, an approach using solver callback functions for the evaluation of system and security constraints in the branch-and-bound tree, and one based on a shrinking horizon decomposition integrated with the use of callback functions. The three approaches were tested over five different case studies and compared against an approach taken from literature to assess scalability and performance. Results show that the modified iterative approach is always faster than the original one reported in the literature (between −58% and −93% run time), while the callback-based method does not reduce the computational time of large-scale instances. Finally, the shrinking-horizon-based approach was proved to be the fastest (up to −98% less time) despite not guaranteeing optimality (about 1% suboptimal).</div></div>","PeriodicalId":50326,"journal":{"name":"International Journal of Electrical Power & Energy Systems","volume":null,"pages":null},"PeriodicalIF":5.0000,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving the security constrained unit commitment problem: Three novel approaches\",\"authors\":\"Alessandro Francesco Castelli , Iiro Harjunkoski , Jan Poland , Marco Giuntoli , Emanuele Martelli , Ignacio E. Grossmann\",\"doi\":\"10.1016/j.ijepes.2024.110213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This work proposes three novel approaches to speed up the solution of the Security Constrained Unit Commitment problem: an improvement of an active-set iterative approach taken from literature, an approach using solver callback functions for the evaluation of system and security constraints in the branch-and-bound tree, and one based on a shrinking horizon decomposition integrated with the use of callback functions. The three approaches were tested over five different case studies and compared against an approach taken from literature to assess scalability and performance. Results show that the modified iterative approach is always faster than the original one reported in the literature (between −58% and −93% run time), while the callback-based method does not reduce the computational time of large-scale instances. Finally, the shrinking-horizon-based approach was proved to be the fastest (up to −98% less time) despite not guaranteeing optimality (about 1% suboptimal).</div></div>\",\"PeriodicalId\":50326,\"journal\":{\"name\":\"International Journal of Electrical Power & Energy Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.0000,\"publicationDate\":\"2024-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Electrical Power & Energy Systems\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0142061524004344\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Electrical Power & Energy Systems","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0142061524004344","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
Solving the security constrained unit commitment problem: Three novel approaches
This work proposes three novel approaches to speed up the solution of the Security Constrained Unit Commitment problem: an improvement of an active-set iterative approach taken from literature, an approach using solver callback functions for the evaluation of system and security constraints in the branch-and-bound tree, and one based on a shrinking horizon decomposition integrated with the use of callback functions. The three approaches were tested over five different case studies and compared against an approach taken from literature to assess scalability and performance. Results show that the modified iterative approach is always faster than the original one reported in the literature (between −58% and −93% run time), while the callback-based method does not reduce the computational time of large-scale instances. Finally, the shrinking-horizon-based approach was proved to be the fastest (up to −98% less time) despite not guaranteeing optimality (about 1% suboptimal).
期刊介绍:
The journal covers theoretical developments in electrical power and energy systems and their applications. The coverage embraces: generation and network planning; reliability; long and short term operation; expert systems; neural networks; object oriented systems; system control centres; database and information systems; stock and parameter estimation; system security and adequacy; network theory, modelling and computation; small and large system dynamics; dynamic model identification; on-line control including load and switching control; protection; distribution systems; energy economics; impact of non-conventional systems; and man-machine interfaces.
As well as original research papers, the journal publishes short contributions, book reviews and conference reports. All papers are peer-reviewed by at least two referees.