A fast and scalable algorithm for scheduling large numbers of devices under real-time pricing

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

Abstract

Real-time pricing (RTP) is a financial incentive mechanism designed to encourage demand response (DR) to reduce peak demand in medium and low voltage distribution networks but also impacting the generation and transmission system. Though RTP is believed to be an effective mechanism, challenges exist in implementing RTP for residential consumers wherein manually responding to a changing price is difficult and uncoordinated responses can lead to undesired peak demand at what are normally off-peak times. Previous research has proposed various algorithms to address these challenges, however, they rarely consider algorithms that manage very large numbers of houses and devices with discrete consumption levels. To optimise conflicting objectives under RTP prices in a fast and highly scalable manner is very challenging. We address these issues by proposing a fast and highly scalable algorithm that optimally schedules devices for large numbers of households in a distributed but non-cooperative manner under RTP. The results show that this algorithm minimises the total cost and discomfort for 10,000 households in a second and has a constant computational complexity.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming
Subtitle of host publication24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings
EditorsJohn Hooker
Place of PublicationCham Switzerland
PublisherSpringer
Pages649-666
Number of pages18
ISBN (Electronic)9783319983349
ISBN (Print)9783319983332
DOIs
Publication statusPublished - 2018
EventInternational Conference on Principles and Practice of Constraint Programming 2018 - Lille, France
Duration: 27 Aug 201831 Aug 2018
Conference number: 24th
http://cp2018.a4cp.org/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11008
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Principles and Practice of Constraint Programming 2018
Abbreviated titleCP 2018
CountryFrance
CityLille
Period27/08/1831/08/18
Internet address

Cite this

He, S., Wallace, M., Gange, G., Liebman, A., & Wilson, C. (2018). A fast and scalable algorithm for scheduling large numbers of devices under real-time pricing. In J. Hooker (Ed.), Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings (pp. 649-666). (Lecture Notes in Computer Science ; Vol. 11008). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-319-98334-9_42
He, Shan ; Wallace, Mark ; Gange, Graeme ; Liebman, Ariel ; Wilson, Campbell. / A fast and scalable algorithm for scheduling large numbers of devices under real-time pricing. Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. editor / John Hooker. Cham Switzerland : Springer, 2018. pp. 649-666 (Lecture Notes in Computer Science ).
@inproceedings{b116a1555b254105beea92141214b989,
title = "A fast and scalable algorithm for scheduling large numbers of devices under real-time pricing",
abstract = "Real-time pricing (RTP) is a financial incentive mechanism designed to encourage demand response (DR) to reduce peak demand in medium and low voltage distribution networks but also impacting the generation and transmission system. Though RTP is believed to be an effective mechanism, challenges exist in implementing RTP for residential consumers wherein manually responding to a changing price is difficult and uncoordinated responses can lead to undesired peak demand at what are normally off-peak times. Previous research has proposed various algorithms to address these challenges, however, they rarely consider algorithms that manage very large numbers of houses and devices with discrete consumption levels. To optimise conflicting objectives under RTP prices in a fast and highly scalable manner is very challenging. We address these issues by proposing a fast and highly scalable algorithm that optimally schedules devices for large numbers of households in a distributed but non-cooperative manner under RTP. The results show that this algorithm minimises the total cost and discomfort for 10,000 households in a second and has a constant computational complexity.",
author = "Shan He and Mark Wallace and Graeme Gange and Ariel Liebman and Campbell Wilson",
year = "2018",
doi = "10.1007/978-3-319-98334-9_42",
language = "English",
isbn = "9783319983332",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "649--666",
editor = "John Hooker",
booktitle = "Principles and Practice of Constraint Programming",

}

He, S, Wallace, M, Gange, G, Liebman, A & Wilson, C 2018, A fast and scalable algorithm for scheduling large numbers of devices under real-time pricing. in J Hooker (ed.), Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. Lecture Notes in Computer Science , vol. 11008, Springer, Cham Switzerland, pp. 649-666, International Conference on Principles and Practice of Constraint Programming 2018, Lille, France, 27/08/18. https://doi.org/10.1007/978-3-319-98334-9_42

A fast and scalable algorithm for scheduling large numbers of devices under real-time pricing. / He, Shan; Wallace, Mark; Gange, Graeme; Liebman, Ariel; Wilson, Campbell.

Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. ed. / John Hooker. Cham Switzerland : Springer, 2018. p. 649-666 (Lecture Notes in Computer Science ; Vol. 11008).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - A fast and scalable algorithm for scheduling large numbers of devices under real-time pricing

AU - He, Shan

AU - Wallace, Mark

AU - Gange, Graeme

AU - Liebman, Ariel

AU - Wilson, Campbell

PY - 2018

Y1 - 2018

N2 - Real-time pricing (RTP) is a financial incentive mechanism designed to encourage demand response (DR) to reduce peak demand in medium and low voltage distribution networks but also impacting the generation and transmission system. Though RTP is believed to be an effective mechanism, challenges exist in implementing RTP for residential consumers wherein manually responding to a changing price is difficult and uncoordinated responses can lead to undesired peak demand at what are normally off-peak times. Previous research has proposed various algorithms to address these challenges, however, they rarely consider algorithms that manage very large numbers of houses and devices with discrete consumption levels. To optimise conflicting objectives under RTP prices in a fast and highly scalable manner is very challenging. We address these issues by proposing a fast and highly scalable algorithm that optimally schedules devices for large numbers of households in a distributed but non-cooperative manner under RTP. The results show that this algorithm minimises the total cost and discomfort for 10,000 households in a second and has a constant computational complexity.

AB - Real-time pricing (RTP) is a financial incentive mechanism designed to encourage demand response (DR) to reduce peak demand in medium and low voltage distribution networks but also impacting the generation and transmission system. Though RTP is believed to be an effective mechanism, challenges exist in implementing RTP for residential consumers wherein manually responding to a changing price is difficult and uncoordinated responses can lead to undesired peak demand at what are normally off-peak times. Previous research has proposed various algorithms to address these challenges, however, they rarely consider algorithms that manage very large numbers of houses and devices with discrete consumption levels. To optimise conflicting objectives under RTP prices in a fast and highly scalable manner is very challenging. We address these issues by proposing a fast and highly scalable algorithm that optimally schedules devices for large numbers of households in a distributed but non-cooperative manner under RTP. The results show that this algorithm minimises the total cost and discomfort for 10,000 households in a second and has a constant computational complexity.

UR - http://www.scopus.com/inward/record.url?scp=85053139385&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-98334-9_42

DO - 10.1007/978-3-319-98334-9_42

M3 - Conference Paper

SN - 9783319983332

T3 - Lecture Notes in Computer Science

SP - 649

EP - 666

BT - Principles and Practice of Constraint Programming

A2 - Hooker, John

PB - Springer

CY - Cham Switzerland

ER -

He S, Wallace M, Gange G, Liebman A, Wilson C. A fast and scalable algorithm for scheduling large numbers of devices under real-time pricing. In Hooker J, editor, Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. Cham Switzerland: Springer. 2018. p. 649-666. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-98334-9_42