{"title":"基于开/关决策准则的机组调试新算法","authors":"Hui-jie Zheng, Bei Guo","doi":"10.1109/NAPS.2005.1560525","DOIUrl":null,"url":null,"abstract":"This paper presents a new algorithm to decide the on/off schedule in unit commitment by using the Lagrangian relaxation method. Theoretical analysis of the presented algorithm is provided. A simple search scheme, which avoids the forward searching and back tracing used by dynamic programming (DP) algorithm, is developed. Theoretical analysis and numerical test results show that the presented algorithm can be the substitute of the existing DP algorithm.","PeriodicalId":101495,"journal":{"name":"Proceedings of the 37th Annual North American Power Symposium, 2005.","volume":"10 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A new algorithm for unit commitment based on on/off decision criterion\",\"authors\":\"Hui-jie Zheng, Bei Guo\",\"doi\":\"10.1109/NAPS.2005.1560525\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new algorithm to decide the on/off schedule in unit commitment by using the Lagrangian relaxation method. Theoretical analysis of the presented algorithm is provided. A simple search scheme, which avoids the forward searching and back tracing used by dynamic programming (DP) algorithm, is developed. Theoretical analysis and numerical test results show that the presented algorithm can be the substitute of the existing DP algorithm.\",\"PeriodicalId\":101495,\"journal\":{\"name\":\"Proceedings of the 37th Annual North American Power Symposium, 2005.\",\"volume\":\"10 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 37th Annual North American Power Symposium, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAPS.2005.1560525\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 37th Annual North American Power Symposium, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAPS.2005.1560525","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new algorithm for unit commitment based on on/off decision criterion
This paper presents a new algorithm to decide the on/off schedule in unit commitment by using the Lagrangian relaxation method. Theoretical analysis of the presented algorithm is provided. A simple search scheme, which avoids the forward searching and back tracing used by dynamic programming (DP) algorithm, is developed. Theoretical analysis and numerical test results show that the presented algorithm can be the substitute of the existing DP algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
