考虑燃料约束的优先列表遗传算法的安全约束单元承诺

2019 7th International Istanbul Smart Grids and Cities Congress and Fair (ICSG) Pub Date : 2019-04-01 DOI:10.1109/SGCF.2019.8782288

Sarjiya, S. P. Hadi, P. H. Putra, Tumiran

{"title":"考虑燃料约束的优先列表遗传算法的安全约束单元承诺","authors":"Sarjiya, S. P. Hadi, P. H. Putra, Tumiran","doi":"10.1109/SGCF.2019.8782288","DOIUrl":null,"url":null,"abstract":"This paper presents genetic algorithm (GA) method development in solving security constrained unit commitment (SCUC). A complex problem occurs when network security constraint and fuel constraint are considered. A proper scheduling plan between unconstrained and constrained units is a must. SCUS problem solving is divided into two steps: unit commitment (UC) and optimal power flow (OPF). UC problem is solved by genetic algorithm based on priority list method. The solution produced from the UC then becomes the initial solution for OPF. Real coded genetic algorithm is used in solving OPF problem with generator status repair and dynamic modeling of fuel constraint. The proposed algorithm is applied on a modified IEEE 118-bus - gas power data system. The final solution of SCUC produced $10,514,820.64 or increased by 8.44% from UC. A dynamic modeling for fuel constraint could maintain fuel consumption while accommodating the constraint.","PeriodicalId":116136,"journal":{"name":"2019 7th International Istanbul Smart Grids and Cities Congress and Fair (ICSG)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Security Constrained Unit Commitment Using Genetic Algorithm Based on Priority List Method with Fuel Constraint Consideration\",\"authors\":\"Sarjiya, S. P. Hadi, P. H. Putra, Tumiran\",\"doi\":\"10.1109/SGCF.2019.8782288\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents genetic algorithm (GA) method development in solving security constrained unit commitment (SCUC). A complex problem occurs when network security constraint and fuel constraint are considered. A proper scheduling plan between unconstrained and constrained units is a must. SCUS problem solving is divided into two steps: unit commitment (UC) and optimal power flow (OPF). UC problem is solved by genetic algorithm based on priority list method. The solution produced from the UC then becomes the initial solution for OPF. Real coded genetic algorithm is used in solving OPF problem with generator status repair and dynamic modeling of fuel constraint. The proposed algorithm is applied on a modified IEEE 118-bus - gas power data system. The final solution of SCUC produced $10,514,820.64 or increased by 8.44% from UC. A dynamic modeling for fuel constraint could maintain fuel consumption while accommodating the constraint.\",\"PeriodicalId\":116136,\"journal\":{\"name\":\"2019 7th International Istanbul Smart Grids and Cities Congress and Fair (ICSG)\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 7th International Istanbul Smart Grids and Cities Congress and Fair (ICSG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SGCF.2019.8782288\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 7th International Istanbul Smart Grids and Cities Congress and Fair (ICSG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SGCF.2019.8782288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文介绍了求解安全约束单元承诺问题的遗传算法的发展。当考虑网络安全约束和燃料约束时，会出现一个复杂的问题。在非约束单元和约束单元之间必须有适当的调度计划。SCUS问题的求解分为两个步骤:单元承诺(UC)和最优潮流(OPF)。采用基于优先级表法的遗传算法求解UC问题。由UC生成的解决方案随后成为OPF的初始解决方案。采用实数编码遗传算法求解具有发电机状态修复和燃料约束动态建模的OPF问题。将该算法应用于改进的ieee118总线燃气电力数据系统。SCUC的最终解决方案产生了10,514,820.64美元，比UC增加了8.44%。对燃料约束进行动态建模，可以在保持燃料消耗的同时适应约束。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Security Constrained Unit Commitment Using Genetic Algorithm Based on Priority List Method with Fuel Constraint Consideration

This paper presents genetic algorithm (GA) method development in solving security constrained unit commitment (SCUC). A complex problem occurs when network security constraint and fuel constraint are considered. A proper scheduling plan between unconstrained and constrained units is a must. SCUS problem solving is divided into two steps: unit commitment (UC) and optimal power flow (OPF). UC problem is solved by genetic algorithm based on priority list method. The solution produced from the UC then becomes the initial solution for OPF. Real coded genetic algorithm is used in solving OPF problem with generator status repair and dynamic modeling of fuel constraint. The proposed algorithm is applied on a modified IEEE 118-bus - gas power data system. The final solution of SCUC produced $10,514,820.64 or increased by 8.44% from UC. A dynamic modeling for fuel constraint could maintain fuel consumption while accommodating the constraint.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 7th International Istanbul Smart Grids and Cities Congress and Fair (ICSG)

自引率

0.00%

发文量