Risk‐constrained offering strategies for a large‐scale price‐maker electric vehicle demand aggregator
In this study, the problem of an electric vehicle (EV) aggregator participating in a three‐settlement pool‐based market is presented. In addition to energy procurement, it is assumed that EVs can sell electricity back to the markets. In order to obtain optimised solutions, the aggregator is consider...
Gespeichert in:
| Veröffentlicht in: | IET smart grid Jg. 3; H. 6; S. 860 - 869 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Durham
The Institution of Engineering and Technology
01.12.2020
John Wiley & Sons, Inc Wiley |
| Schlagworte: | |
| ISSN: | 2515-2947, 2515-2947 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In this study, the problem of an electric vehicle (EV) aggregator participating in a three‐settlement pool‐based market is presented. In addition to energy procurement, it is assumed that EVs can sell electricity back to the markets. In order to obtain optimised solutions, the aggregator is considered as a price‐maker agent who tries to minimise the cost of purchasing energy from the markets by offering price‐energy bids in the day‐ahead market and only energy bids in both adjustment and balancing markets. Since the problem is heavily constrained by equality constraints, the number of binary variables for a 24‐hour market horizon is too large which leads to intractability when solved by traditional mathematical algorithms like the interior point. Therefore, an evolutionary metaheuristic algorithm based on genetic algorithms (GAs) is proposed to deal with the intractability. In this regard, first, the stochastic problem is formulated as a mixed‐integer linear programming problem, and as a non‐linear programming problem to be solved by CPLEX and GA, respectively. The former is used to ensure that the GA is tuned properly, and helps to avoid converging to local extremums. Furthermore, the solutions of the two formulations are compared in simulations to demonstrate GA could be faster in obtaining better results. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2515-2947 2515-2947 |
| DOI: | 10.1049/iet-stg.2019.0210 |