{"title":"Factored Markov decision process models for stochastic unit commitment","authors":"D. Nikovski, Weihong Zhang","doi":"10.1109/CITRES.2010.5619846","DOIUrl":null,"url":null,"abstract":"In this paper, we consider stochastic unit commitment problems where power demand and the output of some generators are random variables. We represent stochastic unit commitment problems in the form of factored Markov decision process models, and propose an approximate algorithm to solve such models. By incorporating a risk component in the cost function, the algorithm can achieve a balance between the operational costs and blackout risks. The proposed algorithm outperformed existing non-stochastic approaches on several problem instances, resulting in both lower risks and operational costs.","PeriodicalId":354280,"journal":{"name":"2010 IEEE Conference on Innovative Technologies for an Efficient and Reliable Electricity Supply","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Conference on Innovative Technologies for an Efficient and Reliable Electricity Supply","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITRES.2010.5619846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
In this paper, we consider stochastic unit commitment problems where power demand and the output of some generators are random variables. We represent stochastic unit commitment problems in the form of factored Markov decision process models, and propose an approximate algorithm to solve such models. By incorporating a risk component in the cost function, the algorithm can achieve a balance between the operational costs and blackout risks. The proposed algorithm outperformed existing non-stochastic approaches on several problem instances, resulting in both lower risks and operational costs.