欧洲电力交易所最低收入条件订单的清算算法

Á. Sleisz, D. Raisz
{"title":"欧洲电力交易所最低收入条件订单的清算算法","authors":"Á. Sleisz, D. Raisz","doi":"10.1109/RTUCON.2014.6998204","DOIUrl":null,"url":null,"abstract":"State-of-the-art power exchange designs have to take a large set of economic and technical constraints into consideration. A specific difficulty is that most power generators have non-convex characteristics, for example startup costs and minimal load during operation. Minimum income condition orders constitute a method to represent some of the power plants' corresponding economic interests on energy markets, e.g. on the proposed all-European day-ahead power exchange. However, the non-convexity of these offers can be computationally expensive. A new clearing algorithm is proposed to manage the issue effectively with advanced mathematical tools.","PeriodicalId":259790,"journal":{"name":"2014 55th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Clearing algorithm for minimum income condition orders on European power exchanges\",\"authors\":\"Á. Sleisz, D. Raisz\",\"doi\":\"10.1109/RTUCON.2014.6998204\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"State-of-the-art power exchange designs have to take a large set of economic and technical constraints into consideration. A specific difficulty is that most power generators have non-convex characteristics, for example startup costs and minimal load during operation. Minimum income condition orders constitute a method to represent some of the power plants' corresponding economic interests on energy markets, e.g. on the proposed all-European day-ahead power exchange. However, the non-convexity of these offers can be computationally expensive. A new clearing algorithm is proposed to manage the issue effectively with advanced mathematical tools.\",\"PeriodicalId\":259790,\"journal\":{\"name\":\"2014 55th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 55th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTUCON.2014.6998204\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 55th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTUCON.2014.6998204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

最先进的电力交换设计必须考虑大量的经济和技术限制。一个具体的困难是,大多数发电机具有非凸特性,例如启动成本和运行期间的最小负载。最低收入条件指令构成了一种在能源市场上代表一些电厂相应经济利益的方法,例如在拟议的全欧洲日前电力交易中。然而,这些报价的非凸性在计算上可能会很昂贵。提出了一种新的清除算法,利用先进的数学工具有效地管理这一问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Clearing algorithm for minimum income condition orders on European power exchanges
State-of-the-art power exchange designs have to take a large set of economic and technical constraints into consideration. A specific difficulty is that most power generators have non-convex characteristics, for example startup costs and minimal load during operation. Minimum income condition orders constitute a method to represent some of the power plants' corresponding economic interests on energy markets, e.g. on the proposed all-European day-ahead power exchange. However, the non-convexity of these offers can be computationally expensive. A new clearing algorithm is proposed to manage the issue effectively with advanced mathematical tools.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信