{"title":"放松管制环境下基于利润的机组承诺问题的能源调度","authors":"Vineet Kumar, R. Naresh, Amita Singh","doi":"10.1109/PIICON49524.2020.9112910","DOIUrl":null,"url":null,"abstract":"The profit-based unit commitment (PBUC) problem is a major combinatorial optimization problem faced by the deregulated power industry. The PBUC problem can find the most price-effective solution by performing and scheduling fuel generating systems. So, in this paper a computationally strong and effective approach ANTIGONE solver under GAMS environment is used to dealt with PBUC problem. The effectiveness of ANTIGONE approach has been examined in the 10 and 100-unit test system PBUC problem over a complete 24 scheduling time horizon. The results of the proposed algorithm are compared with the best solutions reported by previously known best techniques. Comparative results show a qualitative performance of GAMS over other existing techniques in terms of profit obtained and satisfaction level of all diverse constraints.","PeriodicalId":422853,"journal":{"name":"2020 IEEE 9th Power India International Conference (PIICON)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Scheduling of Energy on Deregulated Environment of Profit based Unit Commitment Problem\",\"authors\":\"Vineet Kumar, R. Naresh, Amita Singh\",\"doi\":\"10.1109/PIICON49524.2020.9112910\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The profit-based unit commitment (PBUC) problem is a major combinatorial optimization problem faced by the deregulated power industry. The PBUC problem can find the most price-effective solution by performing and scheduling fuel generating systems. So, in this paper a computationally strong and effective approach ANTIGONE solver under GAMS environment is used to dealt with PBUC problem. The effectiveness of ANTIGONE approach has been examined in the 10 and 100-unit test system PBUC problem over a complete 24 scheduling time horizon. The results of the proposed algorithm are compared with the best solutions reported by previously known best techniques. Comparative results show a qualitative performance of GAMS over other existing techniques in terms of profit obtained and satisfaction level of all diverse constraints.\",\"PeriodicalId\":422853,\"journal\":{\"name\":\"2020 IEEE 9th Power India International Conference (PIICON)\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 9th Power India International Conference (PIICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIICON49524.2020.9112910\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 9th Power India International Conference (PIICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIICON49524.2020.9112910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduling of Energy on Deregulated Environment of Profit based Unit Commitment Problem
The profit-based unit commitment (PBUC) problem is a major combinatorial optimization problem faced by the deregulated power industry. The PBUC problem can find the most price-effective solution by performing and scheduling fuel generating systems. So, in this paper a computationally strong and effective approach ANTIGONE solver under GAMS environment is used to dealt with PBUC problem. The effectiveness of ANTIGONE approach has been examined in the 10 and 100-unit test system PBUC problem over a complete 24 scheduling time horizon. The results of the proposed algorithm are compared with the best solutions reported by previously known best techniques. Comparative results show a qualitative performance of GAMS over other existing techniques in terms of profit obtained and satisfaction level of all diverse constraints.