求解发电机组投用问题的动态规划方法

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI:10.1109/ICCCT.2011.6075161

P. K. Singhal, R. Naresh, Sharma

{"title":"求解发电机组投用问题的动态规划方法","authors":"P. K. Singhal, R. Naresh, Sharma","doi":"10.1109/ICCCT.2011.6075161","DOIUrl":null,"url":null,"abstract":"In this paper, a large scale Unit Commitment (UC) problem has been solved using Conventional dynamic programming (CDP), Sequential dynamic programming (SDP) and Truncation dynamic programming (TDP) without time constraints and the results show the comparison of production cost and CPU time. The UC provides an approach to decrease the cost and improve reliability of the network. The UC is a dynamic process, and the generation plan is always changing according to different load and network topology.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":"{\"title\":\"Dynamic programming approach for solving power generating unit commitment problem\",\"authors\":\"P. K. Singhal, R. Naresh, Sharma\",\"doi\":\"10.1109/ICCCT.2011.6075161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a large scale Unit Commitment (UC) problem has been solved using Conventional dynamic programming (CDP), Sequential dynamic programming (SDP) and Truncation dynamic programming (TDP) without time constraints and the results show the comparison of production cost and CPU time. The UC provides an approach to decrease the cost and improve reliability of the network. The UC is a dynamic process, and the generation plan is always changing according to different load and network topology.\",\"PeriodicalId\":285986,\"journal\":{\"name\":\"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"55\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCT.2011.6075161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCT.2011.6075161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 55

摘要

本文采用常规动态规划(CDP)、顺序动态规划(SDP)和截断动态规划(TDP)三种不带时间约束的方法求解了大规模机组投入(UC)问题，结果显示了生产成本和CPU时间的比较。UC为降低成本、提高网络可靠性提供了一种途径。UC是一个动态的过程，根据不同的负载和网络拓扑结构，生成计划总是会发生变化。

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

查看原文本刊更多论文

Dynamic programming approach for solving power generating unit commitment problem

In this paper, a large scale Unit Commitment (UC) problem has been solved using Conventional dynamic programming (CDP), Sequential dynamic programming (SDP) and Truncation dynamic programming (TDP) without time constraints and the results show the comparison of production cost and CPU time. The UC provides an approach to decrease the cost and improve reliability of the network. The UC is a dynamic process, and the generation plan is always changing according to different load and network topology.

求助全文

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

来源期刊

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)

自引率

0.00%

发文量