Scalable and Robust Demand Response With Mixed-Integer Constraints
- 30 April 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 4 (4), 2089-2099
- https://doi.org/10.1109/tsg.2013.2257893
Abstract
A demand response (DR) problem is considered entailing a set of devices/subscribers, whose operating conditions are modeled using mixed-integer constraints. Device operational periods and power consumption levels are optimized in response to dynamic pricing information to balance user satisfaction and energy cost. Renewable energy resources and energy storage systems are also incorporated. Since DR becomes more effective as the number of participants grows, scalability is ensured through a parallel distributed algorithm, in which a DR coordinator and DR subscribers solve individual subproblems, guided by certain coordination signals. As the problem scales, the recovered solution becomes near-optimal. Robustness to random variations in electricity price and renewable generation is effected through robust optimization techniques. Real-time extension is also discussed. Numerical tests validate the proposed approach.Keywords
This publication has 28 references indexed in Scilit:
- Residential Load Control: Distributed Scheduling and Convergence With Lost AMI MessagesIEEE Transactions on Smart Grid, 2012
- Scheduling Power Consumption With Price UncertaintyIEEE Transactions on Smart Grid, 2011
- Control and optimization meet the smart power gridPublished by Association for Computing Machinery (ACM) ,2011
- Coordinated Scheduling of Residential Distributed Energy Resources to Optimize Smart Home Energy ServicesIEEE Transactions on Smart Grid, 2010
- The Price of RobustnessOperations Research, 2004
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Robust optimization ? methodology and applicationsMathematical Programming, 2002
- An extension of Karmarkar's projective algorithm for convex quadratic programmingMathematical Programming, 1989
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974