Loading…

A novel Traversal-and-Pruning algorithm for household load scheduling

► A novel Traversal-and-Pruning algorithm helps consumers create optimal load schedules both automatically and professionally. ► Both the payment and the comfort level are considered based on the nonlinear thermal dynamic. ► “Inferior Pruning” is defined to keep the balance between the speed and the...

Full description

Saved in:
Bibliographic Details
Published in:Applied energy 2013-02, Vol.102, p.1430-1438
Main Authors: Wang, Chengshan, Zhou, Yue, Wang, Jidong, Peng, Peiyuan
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c399t-e08bdc0e4916ffb48fb1709c10a7e06bd919c2a1688810c4cf0455f934fec1403
cites cdi_FETCH-LOGICAL-c399t-e08bdc0e4916ffb48fb1709c10a7e06bd919c2a1688810c4cf0455f934fec1403
container_end_page 1438
container_issue
container_start_page 1430
container_title Applied energy
container_volume 102
creator Wang, Chengshan
Zhou, Yue
Wang, Jidong
Peng, Peiyuan
description ► A novel Traversal-and-Pruning algorithm helps consumers create optimal load schedules both automatically and professionally. ► Both the payment and the comfort level are considered based on the nonlinear thermal dynamic. ► “Inferior Pruning” is defined to keep the balance between the speed and the optimality of the algorithm. ► In a case, about 20% electricity cost is saved under the same comfort settings compared to the original algorithm. ► The novel Traversal-and-Pruning algorithm is robust, fast and flexible as well. With the various detail pricing schemes designed by utilities and the development of the smart grid technologies, consumers are motivated and enabled to schedule their home appliances to save energy, reduce cost and help grid operation. This paper presents a novel Traversal-and-Pruning (TP) algorithm which schedules thermostatically controlled household loads to meet an optimization objective considering both payment and comfort settings. The novel TP algorithm is robust and a flexible method is developed to balance the optimality and speed of the algorithm. Simulation results show that an improved load schedule is obtained by the novel TP algorithm compared to an existing algorithm.
doi_str_mv 10.1016/j.apenergy.2012.09.010
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1505348366</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0306261912006502</els_id><sourcerecordid>1505348366</sourcerecordid><originalsourceid>FETCH-LOGICAL-c399t-e08bdc0e4916ffb48fb1709c10a7e06bd919c2a1688810c4cf0455f934fec1403</originalsourceid><addsrcrecordid>eNqFkEFPGzEQhS1EpQbKXyh7qdTLLjPeXa99K0K0RUICCThbjnecOHLWqZ1E4t_jKJQrp7l8783Tx9h3hAYBxdWqMRuaKC1eGw7IG1ANIJywGcqB1wpRnrIZtCBqLlB9ZWc5rwCAI4cZu72uprinUD0ns6eUTajNNNaPaTf5aVGZsIjJb5frysVULeMu0zKGsQrRjFW2Sxp3oXDf2BdnQqaL93vOXn7fPt_8re8f_tzdXN_XtlVqWxPI-WiBOoXCuXkn3RwHUBbBDARiPipUlhsUUkoE21kHXd871XaOLHbQnrOfx95Niv92lLd67bOlEMxEZZvGHvq2k60QBRVH1KaYcyKnN8mvTXrVCPrgTa_0f2_64E2D0sVbCf54_2GyNcElM1mfP9JcDH0vxVC4yyPnTNRmkQrz8lSKxMGt7HteiF9HgoqSvaeks_U0WRp9IrvVY_SfjXkDCnaP-w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1505348366</pqid></control><display><type>article</type><title>A novel Traversal-and-Pruning algorithm for household load scheduling</title><source>ScienceDirect Freedom Collection 2022-2024</source><creator>Wang, Chengshan ; Zhou, Yue ; Wang, Jidong ; Peng, Peiyuan</creator><creatorcontrib>Wang, Chengshan ; Zhou, Yue ; Wang, Jidong ; Peng, Peiyuan</creatorcontrib><description>► A novel Traversal-and-Pruning algorithm helps consumers create optimal load schedules both automatically and professionally. ► Both the payment and the comfort level are considered based on the nonlinear thermal dynamic. ► “Inferior Pruning” is defined to keep the balance between the speed and the optimality of the algorithm. ► In a case, about 20% electricity cost is saved under the same comfort settings compared to the original algorithm. ► The novel Traversal-and-Pruning algorithm is robust, fast and flexible as well. With the various detail pricing schemes designed by utilities and the development of the smart grid technologies, consumers are motivated and enabled to schedule their home appliances to save energy, reduce cost and help grid operation. This paper presents a novel Traversal-and-Pruning (TP) algorithm which schedules thermostatically controlled household loads to meet an optimization objective considering both payment and comfort settings. The novel TP algorithm is robust and a flexible method is developed to balance the optimality and speed of the algorithm. Simulation results show that an improved load schedule is obtained by the novel TP algorithm compared to an existing algorithm.</description><identifier>ISSN: 0306-2619</identifier><identifier>EISSN: 1872-9118</identifier><identifier>DOI: 10.1016/j.apenergy.2012.09.010</identifier><identifier>CODEN: APENDX</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>algorithms ; Appliance commitment ; appliances ; Applied sciences ; cost effectiveness ; Economic data ; Electric energy ; Energy ; Energy economics ; Exact sciences and technology ; General, economic and professional studies ; Home energy management ; Load scheduling ; Methodology. Modelling ; prices ; pricing ; pruning ; Thermostatically controlled load</subject><ispartof>Applied energy, 2013-02, Vol.102, p.1430-1438</ispartof><rights>2012 Elsevier Ltd</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c399t-e08bdc0e4916ffb48fb1709c10a7e06bd919c2a1688810c4cf0455f934fec1403</citedby><cites>FETCH-LOGICAL-c399t-e08bdc0e4916ffb48fb1709c10a7e06bd919c2a1688810c4cf0455f934fec1403</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=26755867$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Wang, Chengshan</creatorcontrib><creatorcontrib>Zhou, Yue</creatorcontrib><creatorcontrib>Wang, Jidong</creatorcontrib><creatorcontrib>Peng, Peiyuan</creatorcontrib><title>A novel Traversal-and-Pruning algorithm for household load scheduling</title><title>Applied energy</title><description>► A novel Traversal-and-Pruning algorithm helps consumers create optimal load schedules both automatically and professionally. ► Both the payment and the comfort level are considered based on the nonlinear thermal dynamic. ► “Inferior Pruning” is defined to keep the balance between the speed and the optimality of the algorithm. ► In a case, about 20% electricity cost is saved under the same comfort settings compared to the original algorithm. ► The novel Traversal-and-Pruning algorithm is robust, fast and flexible as well. With the various detail pricing schemes designed by utilities and the development of the smart grid technologies, consumers are motivated and enabled to schedule their home appliances to save energy, reduce cost and help grid operation. This paper presents a novel Traversal-and-Pruning (TP) algorithm which schedules thermostatically controlled household loads to meet an optimization objective considering both payment and comfort settings. The novel TP algorithm is robust and a flexible method is developed to balance the optimality and speed of the algorithm. Simulation results show that an improved load schedule is obtained by the novel TP algorithm compared to an existing algorithm.</description><subject>algorithms</subject><subject>Appliance commitment</subject><subject>appliances</subject><subject>Applied sciences</subject><subject>cost effectiveness</subject><subject>Economic data</subject><subject>Electric energy</subject><subject>Energy</subject><subject>Energy economics</subject><subject>Exact sciences and technology</subject><subject>General, economic and professional studies</subject><subject>Home energy management</subject><subject>Load scheduling</subject><subject>Methodology. Modelling</subject><subject>prices</subject><subject>pricing</subject><subject>pruning</subject><subject>Thermostatically controlled load</subject><issn>0306-2619</issn><issn>1872-9118</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNqFkEFPGzEQhS1EpQbKXyh7qdTLLjPeXa99K0K0RUICCThbjnecOHLWqZ1E4t_jKJQrp7l8783Tx9h3hAYBxdWqMRuaKC1eGw7IG1ANIJywGcqB1wpRnrIZtCBqLlB9ZWc5rwCAI4cZu72uprinUD0ns6eUTajNNNaPaTf5aVGZsIjJb5frysVULeMu0zKGsQrRjFW2Sxp3oXDf2BdnQqaL93vOXn7fPt_8re8f_tzdXN_XtlVqWxPI-WiBOoXCuXkn3RwHUBbBDARiPipUlhsUUkoE21kHXd871XaOLHbQnrOfx95Niv92lLd67bOlEMxEZZvGHvq2k60QBRVH1KaYcyKnN8mvTXrVCPrgTa_0f2_64E2D0sVbCf54_2GyNcElM1mfP9JcDH0vxVC4yyPnTNRmkQrz8lSKxMGt7HteiF9HgoqSvaeks_U0WRp9IrvVY_SfjXkDCnaP-w</recordid><startdate>20130201</startdate><enddate>20130201</enddate><creator>Wang, Chengshan</creator><creator>Zhou, Yue</creator><creator>Wang, Jidong</creator><creator>Peng, Peiyuan</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>FBQ</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7ST</scope><scope>C1K</scope><scope>SOI</scope></search><sort><creationdate>20130201</creationdate><title>A novel Traversal-and-Pruning algorithm for household load scheduling</title><author>Wang, Chengshan ; Zhou, Yue ; Wang, Jidong ; Peng, Peiyuan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c399t-e08bdc0e4916ffb48fb1709c10a7e06bd919c2a1688810c4cf0455f934fec1403</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>algorithms</topic><topic>Appliance commitment</topic><topic>appliances</topic><topic>Applied sciences</topic><topic>cost effectiveness</topic><topic>Economic data</topic><topic>Electric energy</topic><topic>Energy</topic><topic>Energy economics</topic><topic>Exact sciences and technology</topic><topic>General, economic and professional studies</topic><topic>Home energy management</topic><topic>Load scheduling</topic><topic>Methodology. Modelling</topic><topic>prices</topic><topic>pricing</topic><topic>pruning</topic><topic>Thermostatically controlled load</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Chengshan</creatorcontrib><creatorcontrib>Zhou, Yue</creatorcontrib><creatorcontrib>Wang, Jidong</creatorcontrib><creatorcontrib>Peng, Peiyuan</creatorcontrib><collection>AGRIS</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Environment Abstracts</collection><collection>Environmental Sciences and Pollution Management</collection><collection>Environment Abstracts</collection><jtitle>Applied energy</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Chengshan</au><au>Zhou, Yue</au><au>Wang, Jidong</au><au>Peng, Peiyuan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A novel Traversal-and-Pruning algorithm for household load scheduling</atitle><jtitle>Applied energy</jtitle><date>2013-02-01</date><risdate>2013</risdate><volume>102</volume><spage>1430</spage><epage>1438</epage><pages>1430-1438</pages><issn>0306-2619</issn><eissn>1872-9118</eissn><coden>APENDX</coden><abstract>► A novel Traversal-and-Pruning algorithm helps consumers create optimal load schedules both automatically and professionally. ► Both the payment and the comfort level are considered based on the nonlinear thermal dynamic. ► “Inferior Pruning” is defined to keep the balance between the speed and the optimality of the algorithm. ► In a case, about 20% electricity cost is saved under the same comfort settings compared to the original algorithm. ► The novel Traversal-and-Pruning algorithm is robust, fast and flexible as well. With the various detail pricing schemes designed by utilities and the development of the smart grid technologies, consumers are motivated and enabled to schedule their home appliances to save energy, reduce cost and help grid operation. This paper presents a novel Traversal-and-Pruning (TP) algorithm which schedules thermostatically controlled household loads to meet an optimization objective considering both payment and comfort settings. The novel TP algorithm is robust and a flexible method is developed to balance the optimality and speed of the algorithm. Simulation results show that an improved load schedule is obtained by the novel TP algorithm compared to an existing algorithm.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.apenergy.2012.09.010</doi><tpages>9</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0306-2619
ispartof Applied energy, 2013-02, Vol.102, p.1430-1438
issn 0306-2619
1872-9118
language eng
recordid cdi_proquest_miscellaneous_1505348366
source ScienceDirect Freedom Collection 2022-2024
subjects algorithms
Appliance commitment
appliances
Applied sciences
cost effectiveness
Economic data
Electric energy
Energy
Energy economics
Exact sciences and technology
General, economic and professional studies
Home energy management
Load scheduling
Methodology. Modelling
prices
pricing
pruning
Thermostatically controlled load
title A novel Traversal-and-Pruning algorithm for household load scheduling
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T04%3A09%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20novel%20Traversal-and-Pruning%20algorithm%20for%20household%20load%20scheduling&rft.jtitle=Applied%20energy&rft.au=Wang,%20Chengshan&rft.date=2013-02-01&rft.volume=102&rft.spage=1430&rft.epage=1438&rft.pages=1430-1438&rft.issn=0306-2619&rft.eissn=1872-9118&rft.coden=APENDX&rft_id=info:doi/10.1016/j.apenergy.2012.09.010&rft_dat=%3Cproquest_cross%3E1505348366%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c399t-e08bdc0e4916ffb48fb1709c10a7e06bd919c2a1688810c4cf0455f934fec1403%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1505348366&rft_id=info:pmid/&rfr_iscdi=true