CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A greedy algorithm for the unforecasted energy dispatch problem with storage in smart grids

Giorgos Georgiadis (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers)) ; Marina Papatriantafilou (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers))
e-Energy 2013 - Proceedings of the 4th ACM International Conference on Future Energy Systems p. 273-274. (2013)
[Konferensbidrag, refereegranskat]

Integration of renewable and distributed energy sources is today possible through the use of the Smart Grid but these technologies bring benefits as well as challenges, such as their intermittent nature that leads to utilization problems for the grid. On the other hand, upcoming storage technologies, such as electrical cars, hold the potential to store and utilize this intermittent supply at a later time but bring challenges of their own, for example efficient storage utilization and intermittent energy demand. In this work we propose a novel modeling of the problem of unforecasted energy dispatch with storage as a scheduling problem of tasks on machines and an associated greedy algorithm with a guaranteed performance, along with an efficient algorithm for the problem. Finally, we outline an extensive simulation study for a variety of scenarios based on data from a large network of customers.

Nyckelord: online scheduling, resource allocation, smart grid



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-11-19. Senast ändrad 2013-12-04.
CPL Pubid: 187024

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)