Auctions for Congestion Management in Distribution Grids

Conference Paper (2016)
Author(s)

R.M. Philipsen (TU Delft - Algorithmics)

MM Weerdt (TU Delft - Algorithmics)

L.J. De Vries (TU Delft - Energy and Industry)

Research Group
Algorithmics
Copyright
© 2016 R.M. Philipsen, M.M. de Weerdt, Laurens De Vries
DOI related publication
https://doi.org/10.1109/EEM.2016.7521326
More Info
expand_more
Publication Year
2016
Language
English
Copyright
© 2016 R.M. Philipsen, M.M. de Weerdt, Laurens De Vries
Research Group
Algorithmics
Pages (from-to)
1-5
ISBN (print)
978-5090-1297-8
ISBN (electronic)
978-1-5090-1298-5
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Large controllable loads, such as electric vehicles, are increasingly penetrating electricity distribution feeders. To avoid local congestion, their consumption behaviour must be steered, for which a real-time price propagated down from the transmission system does not suffice, as it does not reflect local grid conditions. To efficiently steer the charging of EVs by multiple self-interested parties, we propose an auction framework which accounts for local grid conditions, the limited flexibility of EVs, and the uncertainty inherent to small-scale networks. We formulate the EV charging problem as a job scheduling problem for self-interested aggregators, and auction network capacity
for discrete time slots using sequentially-cleared auctions, which run in parallel. We simulate this auction on a local network using realistic data for EV driving behaviour and network capacity, showing this method leads to feasible allocations which are fairer in case one party is weaker than the other due to size or information asymmetry.

Files

Eem_dgcm_PDFEXPRESS.pdf
(pdf | 0.278 Mb)
License info not available