Data-Driven Inverse Optimization with Applications in Electricity Markets
Notice bibliographique
Résumé
Due to the increasing penetration of renewable resources and demand response instruments in the electricity markets, generation planning models have become more complex and require detailed information on the inherent structure of the system, including generator and demand parameters. Demand should be met by cost-effective, adaptable, and efficient power plants to ensure that it is met even in the worst-case scenarios, such as an unanticipated peak or the failure of a critical generating unit. On the other hand, there is a need to consider short-term details in the Planning problems to address the needed system flexibility due to sudden changes in demand and renewables generation. Such short-term details increase the size of the models and their related computations. As a result, there is a trade-off between the complexity of the computation and the level of short-term operational details, which should be considered. \n \nAccessing electricity infrastructure data in North America is often difficult due to the lack of open data standards and the proprietary nature of much of the data. The regulations and policies surrounding the data also vary significantly from province to province, making it difficult to access the data uniformly. Additionally, privacy and security considerations can limit access even further. Despite these limitations, there are indirect methods such as inverse optimization(IO) to derive the market parameters using publicly available data; examples of these parameters include generator costs of generation, their capabilities, etc. The discovery of unobservable information via IO could aid energy models to account for operational details without increasing the complexity of their problem. Furthermore, this information can inform policymakers on potential interventions to improve the efficiency of the electricity market. \n \nIn this research, a MIP model is developed to incorporate capital and operational costs associated with long-term planning problems. The operating costs of each technology are assumed to be approximated by a series of step-wise functions so that model outcomes, such as generation output, are as close as possible to real-world electricity market generation. The proposed method employs a two-stage algorithmic framework using data-driven inverse optimization and regression. In the first stage, constraints are generated based on relationships between cost and electricity prices. In the second stage, these constraints on costs are added to a problem that finds and reconciles the parameters of the cost functions. To evaluate the performances of the proposed IO-based method, it was applied to a DC-OPF model using the IEEE 24-bus system, which helped eliminate power flow constraints. This approach was then applied to a long-term planning model using Ontario's electricity market data. The results indicate that the proposed approach could find a close solution to the conventional models. In the long-term planning model, the IO-based approach showed more moderate investment policies, while the traditional methods tend to over or under-invest.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,002 | 0,008 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,001 |
| Bibliométrie | 0,001 | 0,002 |
| Études des sciences et des technologies | 0,001 | 0,001 |
| Communication savante | 0,002 | 0,001 |
| Science ouverte | 0,001 | 0,002 |
| Intégrité de la recherche | 0,002 | 0,003 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,005 | 0,001 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».