Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/22646
Title: | Gaussian process-based Bayesian optimization for data-driven unit commitment | Authors: | Nikolaidis, Pavlos Chatzis, Sotirios P. |
Major Field of Science: | Natural Sciences | Field Category: | Computer and Information Sciences | Keywords: | Unit commitment;Machine learning model;Bayesian optimization;Global optimization;Volatile behavioral patterns | Issue Date: | Sep-2021 | Source: | International Journal of Electrical Power & Energy Systems, 2021, vol. 130. articl. no. 106930 | Volume: | 130 | Journal: | International Journal of Electrical Power & Energy Systems | Abstract: | Global efforts aiming to shift towards de-carbonization give rise to remarkable challenges for power systems and their operators. Modern power systems need to deal with the uncertain and volatile behavior of their components (especially, renewable energy generation); this necessitates the use of increased operating reserves. To ameliorate this expensive requirement, intelligent systems for determining appropriate unit commitment schedules have risen as a promising solution. This is especially the case for weak power systems with low dispatching flexibility and high dependency on imported fossil fuels. In this work, we introduce a radically new paradigm for addressing the optimal unit commitment problem, that is capable of accounting for the largely unaddressed challenge of the uncertain and volatile behavior of modern power systems. Our solution leverages widely adopted developments in the field of uncertainty-aware machine learning models, namely Bayesian optimization. This framework enables the effective discovery of the best possible configuration of a volatile system with uncertain and unknown dynamics, without the need of introducing restrictive prior assumptions. Based on appropriately selected acquisition function and Gaussian process regression, it constitutes a radically different from existing approaches, which heavily rely on heuristic approximations and do not allow to account for volatile behavioral patterns. On the contrary, it guarantees global optimum solutions in non-convex optimization tasks in the least possible number of trials. The demonstrated results show better performance in terms of total production cost and number of function evaluations, inspiring system operators to better schedule their power networks in the forthcoming, de-carbonized grids. | URI: | https://hdl.handle.net/20.500.14279/22646 | ISSN: | 01420615 | DOI: | 10.1016/j.ijepes.2021.106930 | Rights: | © Elsevier | Type: | Article | Affiliation : | Cyprus University of Technology | Publication Type: | Peer Reviewed |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
18
checked on Nov 9, 2023
WEB OF SCIENCETM
Citations
17
Last Week
0
0
Last month
1
1
checked on Oct 29, 2023
Page view(s) 50
341
Last Week
1
1
Last month
3
3
checked on Dec 22, 2024
Google ScholarTM
Check
Altmetric
This item is licensed under a Creative Commons License