| Autor: |
Bergmeir, Christoph, de Nijs, Frits, Sriramulu, Abishek, Abolghasemi, Mahdi, Bean, Richard, Betts, John, Bui, Quang, Dinh, Nam Trong, Einecke, Nils, Esmaeilbeigi, Rasul, Ferraro, Scott, Galketiya, Priya, Genov, Evgenii, Glasgow, Robert, Godahewa, Rakshitha, Kang, Yanfei, Limmer, Steffen, Magdalena, Luis, Montero-Manso, Pablo, Peralta, Daniel, Kumar, Yogesh Pipada Sunil, Rosales-Pérez, Alejandro, Ruddick, Julian, Stratigakos, Akylas, Stuckey, Peter, Tack, Guido, Triguero, Isaac, Yuan, Rui |
| Rok vydání: |
2022 |
| Předmět: |
|
| Druh dokumentu: |
Working Paper |
| Popis: |
Algorithms that involve both forecasting and optimization are at the core of solutions to many difficult real-world problems, such as in supply chains (inventory optimization), traffic, and in the transition towards carbon-free energy generation in battery/load/production scheduling in sustainable energy systems. Typically, in these scenarios we want to solve an optimization problem that depends on unknown future values, which therefore need to be forecast. As both forecasting and optimization are difficult problems in their own right, relatively few research has been done in this area. This paper presents the findings of the ``IEEE-CIS Technical Challenge on Predict+Optimize for Renewable Energy Scheduling," held in 2021. We present a comparison and evaluation of the seven highest-ranked solutions in the competition, to provide researchers with a benchmark problem and to establish the state of the art for this benchmark, with the aim to foster and facilitate research in this area. The competition used data from the Monash Microgrid, as well as weather data and energy market data. It then focused on two main challenges: forecasting renewable energy production and demand, and obtaining an optimal schedule for the activities (lectures) and on-site batteries that lead to the lowest cost of energy. The most accurate forecasts were obtained by gradient-boosted tree and random forest models, and optimization was mostly performed using mixed integer linear and quadratic programming. The winning method predicted different scenarios and optimized over all scenarios jointly using a sample average approximation method. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
