Sabir, S., Kelouwani, S., Henao, N., Toquica, D., Fournier, M., Agbossou, K. et Oviedo, J. C. (2025). A Clearing Mechanism with Reduced Computational Complexity for Spot Flexibility Markets. Journal of Modern Power Systems and Clean Energy, 13 (2). pp. 650-662. ISSN 2196-5420 DOI 10.35833/MPCE.2024.000264
Prévisualisation |
PDF
Télécharger (1MB) | Prévisualisation |
Résumé
The spot flexibility markets are before the real-time energy exchange, allowing demand-side management to reduce energy consumption during peak periods. In these markets, demand aggregators must quickly choose the customers' reduction bids that fulfill grid requirements. This clearing procedure is challenging due to the computational complexity of selecting the optimal bids. Therefore, developing a clearing mechanism that avoids searching the entire flexibility bid space while respecting grid constraints is essential for the smooth operation of the spot flexibility market. This paper presents a clearing mechanism with reduced computational complexity of the winner determination problem in spot flexibility market for demand aggregators carrying out reductions in energy consumption. The proposed approach transforms customers' flexibility bids into a reward-based function. Afterward, the gradient-based optimization solves the bid selection problem. This approach helps demand aggregators achieve satisfactory energy reductions within an appropriate delay for spot flexibility markets. A comparative study presents the effectiveness of the proposed approach against commonly used approaches: hybrid particle swarm optimization genetic algorithm and combinatorial search.
| Type de document: | Article |
|---|---|
| Mots-clés libres: | Combinatorial auction Computational complexity Demand response Flexibility Spot flexibility market Transactive energy Clearing Gradient-based optimization |
| Date de dépôt: | 20 août 2025 15:18 |
| Dernière modification: | 20 août 2025 15:18 |
| URI: | https://depot-e.uqtr.ca/id/eprint/12208 |
Actions (administrateurs uniquement)
![]() |
Éditer la notice |


Statistiques de téléchargement
Statistiques de téléchargement