{"title":"Tabu search for the optimization of household energy consumption","authors":"D. Ha, S. Ploix, E. Zamaï, M. Jacomino","doi":"10.1109/IRI.2006.252393","DOIUrl":null,"url":null,"abstract":"This paper focuses on demand-side load management applied to the residential sector. A home automation system controlling household energy is proposed. It is decomposed into three layers: anticipation, reactive and device layers. This paper deals with an anticipation layer that allocates energy by taking into account predicted events. It consists in computing both the starting times of some services and in determining set points of others while satisfying the maximal power constraint. A constraint satisfaction problem formulation has been proposed. Because the complexity is NP-hard, a tabu search is used to solve the problem. It maximizes user comfort and minimizes energy cost. An application example is presented","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"111","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Conference on Information Reuse & Integration","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRI.2006.252393","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 111
Abstract
This paper focuses on demand-side load management applied to the residential sector. A home automation system controlling household energy is proposed. It is decomposed into three layers: anticipation, reactive and device layers. This paper deals with an anticipation layer that allocates energy by taking into account predicted events. It consists in computing both the starting times of some services and in determining set points of others while satisfying the maximal power constraint. A constraint satisfaction problem formulation has been proposed. Because the complexity is NP-hard, a tabu search is used to solve the problem. It maximizes user comfort and minimizes energy cost. An application example is presented