Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2934328.2934329acmotherconferencesArticle/Chapter ViewAbstractPublication Pagese-energyConference Proceedingsconference-collections
research-article

Online microgrid energy generation scheduling revisited: the benefits of randomization and interval prediction

Published: 21 June 2016 Publication History

Abstract

Energy generation scheduling is a fundamental problem in microgrid design that determines the on/off status and the output level of energy sources with the goal of minimizing the cost and satisfying both electricity and heat demand. The uncertainty in both renewable generation and microgrid demand makes the problem drastically different from its counterparts and in traditional power systems and brings out the essential need of online algorithm design. In the literature, an online deterministic algorithm called CHASE has achieved a competitive ratio of 3, which is the best possible among deterministic algorithms. In addition, it has been shown the accurate prediction can improve the performance. This paper revisits the problem by investigating the benefits of randomization and interval prediction, i.e., relaxing accurate prediction assumption by considering an interval of valid ranges for future demand. We propose rCHASE, a randomized algorithm that achieves competitive ratio of around 2.128, improving beyond the best deterministic algorithm. Then, we propose iCHASE, an interval prediction-aware algorithm that is built upon rCHASE and a new extension we developed for the classic ski-rental problem. Our trace-driven experiments demonstrate that iCHASE outperforms CHASE; the average cost reduction of iCHASE is 15.85%, while CHASE reduces the cost by 9.1%.

References

[1]
California commercial end-use survey. Internet: http://capabilities.itron.com/CeusWeb/.
[2]
Green energy. Internet: http://www.green-energy-uk.com/whatischp.html.
[3]
National renewable energy laboratory. Internet: http://wind.nrel.gov.
[4]
Pacific gas and electric company. Internet: http://www.pge.com/nots/rates/tariffs/rateinfo.shtml.
[5]
Tecogen. Internet: http://www.tecogen.com.
[6]
http://www.greentechmedia.com/.
[7]
N. Amjady, F. Keynia, and H. Zareipour. Short-term load forecast of microgrids by a new bilevel prediction strategy. Smart Grid, IEEE Transactions on, 1(3): 286--294, Dec 2010.
[8]
A. Borodin and R. El-Yaniv. Online computation and competitive analysis. cambridge university press, 2005.
[9]
M. Carrión and J. Arroyo. A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Systems, 21(3): 1371--1378, 2006.
[10]
P. Chen and H. Chang. Large-scale economic dispatch by genetic algorithm. IEEE Trans. Power Systems, 10(4): 1919--1926, 1995.
[11]
Z. Gaing. Particle swarm optimization to solving the economic dispatch considering the generator constraints. IEEE Trans. Power Systems, 18(3): 1187--1195, 2003.
[12]
X. Guan, Q. Zhai, and A. Papalexopoulos. Optimization based methods for unit commitment: Lagrangian relaxation versus general mixed integer programming. In Proc. IEEE PES General Meeting, 2003.
[13]
T. Guo, M. Henwood, and M. van Ooijen. An algorithm for combined heat and power economic dispatch. IEEE Trans. Power Systems, 11(4): 1778--1784, 1996.
[14]
M. H. Hajiesmaili, C.-K. Chau, M. Chen, and L. Huang. Online microgrid energy generation scheduling revisited: The benefits of randomization and interval prediction. Technical report, https://staff.ie.cuhk.edu.hk/mhchen/papers/CHASER.tr.pdf.
[15]
A. Hawkes and M. Leach. Modelling high level system design and unit commitment for a microgrid. Applied energy, 86(7): 1253--1265, 2009.
[16]
C. Hernandez-Aramburo, T. Green, and N. Mugniot. Fuel consumption minimization of a microgrid. IEEE Trans. Industry Applications, 41(3): 673--681, 2005.
[17]
S. Kazarlis, A. Bakirtzis, and V. Petridis. A genetic algorithm solution to the unit commitment problem. IEEE Trans. Power Systems, 11(1): 83--92, 1996.
[18]
L. Lu, J. Tu, C.-K. Chau, M. Chen, and X. Lin. Online energy generation scheduling for microgrids with intermittent energy sources and co-generation. In Proc. of ACM SIGMETRICS, pages 53--66, 2013.
[19]
B. Narayanaswamy, V. Garg, and T. Jayram. Online optimization for the smart (micro) grid. In Proc. ACM International Conference on Future Energy Systems, 2012.
[20]
N. Padhy. Unit commitment-a bibliographical survey. IEEE Trans. Power Systems, 19(2): 1196--1205, 2004.
[21]
A. Selvakumar and K. Thanushkodi. A new particle swarm optimization solution to nonconvex economic dispatch problems. IEEE Trans. Power Systems, 22(1): 42--51, 2007.
[22]
N. A. Shrivastava, K. Lohia, and B. K. Panigrahi. A multiobjective framework for wind speed prediction interval forecasts. Renewable Energy, 87: 903--910, 2016.
[23]
W. Snyder, H. Powell, and J. Rayburn. Dynamic programming approach to unit commitment. IEEE Trans. Power Systems, 2(2): 339--348, 1987.
[24]
S. Takriti, J. Birge, and E. Long. A stochastic model for the unit commitment problem. IEEE Trans. Power Systems, 11(3): 1497--1508, 1996.
[25]
D. Torregrossa, J.-Y. Le Boudec, and M. Paolone. Model-free computation of ultra-short-term prediction intervals of solar irradiance. Solar Energy, 124: 57--67, 2016.
[26]
V. V. Vazirani. Approximation algorithms. Springer Science & Business Media, 2013.
[27]
C. Wan, Z. Xu, P. Pinson, Z. Y. Dong, and K. P. Wong. Optimal prediction intervals of wind power generation. Power Systems, IEEE Transactions on, 29(3): 1166--1174, 2014.
[28]
J. Wang, M. Shahidehpour, and Z. Li. Security-constrained unit commitment with volatile wind power generation. IEEE Trans. Power Systems, 23(3): 1319--1327, 2008.
[29]
G. Zhang, Y. Wu, K. P. Wong, Z. Xu, Z. Y. Dong, and H.-C. Iu. An advanced approach for construction of optimal wind power prediction intervals. Power Systems, IEEE Transactions on, 30(5): 2706--2715, Sept 2015.
[30]
Y. Zhang, M. H. Hajiesmaili, and M. Chen. Peak-aware online economic dispatching for microgrids. In Proceedings of the ACM Sixth International Conference on Future Energy Systems (e-Energy), pages 27--36. ACM, 2015.
[31]
M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. School of Computer Science, Carnegie Mellon University, 2003.

Cited By

View all
  • (2024)Combining Regularization With Look-Ahead for Competitive Online Convex OptimizationIEEE/ACM Transactions on Networking10.1109/TNET.2024.335099032:3(2391-2405)Online publication date: Jun-2024
  • (2022)Competitive prediction-aware online algorithms for energy generation scheduling in microgridsProceedings of the Thirteenth ACM International Conference on Future Energy Systems10.1145/3538637.3538867(383-394)Online publication date: 28-Jun-2022
  • (2022)Blockchain-enabled decentralized privacy-preserving group purchasing for retail energy plansProceedings of the Thirteenth ACM International Conference on Future Energy Systems10.1145/3538637.3538848(172-187)Online publication date: 28-Jun-2022
  • Show More Cited By

Index Terms

  1. Online microgrid energy generation scheduling revisited: the benefits of randomization and interval prediction

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Other conferences
      e-Energy '16: Proceedings of the Seventh International Conference on Future Energy Systems
      June 2016
      266 pages
      ISBN:9781450343930
      DOI:10.1145/2934328
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 21 June 2016

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. energy generation scheduling
      2. interval prediction
      3. microgrids
      4. randomized online algorithm

      Qualifiers

      • Research-article

      Funding Sources

      • University Grants Committee of the Hong Kong Special Administrative Region, China
      • National Natural Science Foundation of China Grant
      • National Basic Research Program of China Grant
      • National Basic Research Program of China
      • University Grants Committee of the Hong Kong Special Administrative Region, China, General Research Fund

      Conference

      e-Energy'16

      Acceptance Rates

      Overall Acceptance Rate 160 of 446 submissions, 36%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)7
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 20 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Combining Regularization With Look-Ahead for Competitive Online Convex OptimizationIEEE/ACM Transactions on Networking10.1109/TNET.2024.335099032:3(2391-2405)Online publication date: Jun-2024
      • (2022)Competitive prediction-aware online algorithms for energy generation scheduling in microgridsProceedings of the Thirteenth ACM International Conference on Future Energy Systems10.1145/3538637.3538867(383-394)Online publication date: 28-Jun-2022
      • (2022)Blockchain-enabled decentralized privacy-preserving group purchasing for retail energy plansProceedings of the Thirteenth ACM International Conference on Future Energy Systems10.1145/3538637.3538848(172-187)Online publication date: 28-Jun-2022
      • (2022)Online EV Scheduling Algorithms for Adaptive Charging Networks with Global Peak ConstraintsIEEE Transactions on Sustainable Computing10.1109/TSUSC.2020.29798547:3(537-548)Online publication date: 1-Jul-2022
      • (2022)Scheduling Online EV Charging Demand Response via V2V Auctions and Local GenerationIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2021.310397023:8(11436-11452)Online publication date: Aug-2022
      • (2021)Online Resource Provisioning for Wireless Data CollectionACM Transactions on Sensor Networks10.1145/347064818:1(1-27)Online publication date: 5-Oct-2021
      • (2021)Online Peak-Aware Energy Scheduling with Untrusted AdviceProceedings of the Twelfth ACM International Conference on Future Energy Systems10.1145/3447555.3464860(107-123)Online publication date: 22-Jun-2021
      • (2021)Competitive Online Convex Optimization With Switching Costs and Ramp ConstraintsIEEE/ACM Transactions on Networking10.1109/TNET.2021.305391029:2(876-889)Online publication date: Apr-2021
      • (2021)Combining Regularization with Look-Ahead for Competitive Online Convex OptimizationIEEE INFOCOM 2021 - IEEE Conference on Computer Communications10.1109/INFOCOM42981.2021.9488766(1-10)Online publication date: 10-May-2021
      • (2020)Emission-aware Energy Storage Scheduling for a Greener GridProceedings of the Eleventh ACM International Conference on Future Energy Systems10.1145/3396851.3397755(363-373)Online publication date: 12-Jun-2020
      • Show More Cited By

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media