skip to main content
10.1145/3307772.3328298acmotherconferencesArticle/Chapter ViewAbstractPublication Pagese-energyConference Proceedingsconference-collections
research-article

Shaving Peaks by Augmenting the Dependency Graph

Authors Info & Claims
Published:15 June 2019Publication History

ABSTRACT

Demand Side Management (DSM) is an important building block for future energy systems, since it mitigates the non-dispatchable, fluctuating power generation of renewables. For centralized DSM to be implemented on a large scale, considerable amounts of electrical demands must be scheduled rapidly with high time resolution. To this end, we present the Scheduling With Augmented Graphs (SWAG) heuristic. SWAG uses simple, efficient graph operations on a job dependency graph to optimize schedules with a peak shaving objective. The graph-based approach makes it independent of the time resolution and incorporates job dependencies in a natural way. In a detailed evaluation of the algorithm, SWAG is compared to optimal solutions computed by a mixed-integer program. A comparison of SWAG to another state-of-the-art heuristic on a set of instances based on real-word consumption data demonstrates that SWAG outperforms this competitor, in particular on hard instances.

References

  1. Lukas Barth, Nicole Ludwig, Esther Mengelkamp, and Philipp Staudt. 2018. A comprehensive modelling framework for demand side flexibility in smart grids. Computer Science - Research and Development 33, 1 (01 Feb 2018), 13--23.Google ScholarGoogle Scholar
  2. Lukas Barth and Dorothea Wagner. 2019. Dataset accompanying "Shaving Peaks by Augmenting the Dependency Graph". KITOpen Repository.Google ScholarGoogle Scholar
  3. Simon Bischof, Holger Trittenbach, Michael Vollmer, Dominik Werle, Thomas Blank, and Klemens Böhm. 2018. HIPE -- an Energy-Status-Data Set from Industrial Production. In Proceedings of ACM e-Energy (e-Energy 2018). ACM, New York, NY, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Peter Brucker and Sigrid Knust. 2011. Complex Scheduling (2nd ed.). Springer Publishing Company, Incorporated.Google ScholarGoogle Scholar
  5. Bo Chen, Chris N. Potts, and Gerhard J. Woeginger. 1998. A Review of Machine Scheduling: Complexity, Algorithms and Approximability. Springer US, Boston, MA, 1493--1641.Google ScholarGoogle Scholar
  6. Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, and Peter Widmayer. 2004. Scheduling With Release Times and Deadlines on A Minimum Number of Machines. In Exploring New Frontiers of Theoretical Informatics, Jean-Jacques Levy, Ernst W. Mayr, and John C. Mitchell (Eds.). Springer US, Boston, MA, 209--222.Google ScholarGoogle Scholar
  7. Erik Demeulemeester. 1995. Minimizing Resource Availability Costs in Time-Limited Project Networks. Management Science 41, 10 (1995), 1590--1598. http://www.jstor.org/stable/2632739 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ruilong Deng, Zaiyue Yang, Mo-Yuen Chow, and Jiming Chen. 2015. A Survey on Demand Response in Smart Grids: Mathematical Models and Approaches. IEEE Transactions on Industrial Informatics 11, 3 (June 2015), 570--582.Google ScholarGoogle ScholarCross RefCross Ref
  9. Martin Ester, Hans-Peter Kriegel, Jörg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. AAAI Press, 226--231. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Nicholas Good, Keith A. Ellis, and Pierluigi Mancarella. 2017. Review and classification of barriers and enablers of demand response in the smart grid. Renewable and Sustainable Energy Reviews 72 (2017), 57--72.Google ScholarGoogle ScholarCross RefCross Ref
  11. T. A. Guldemond, Johann L. Hurink, Jacob J. Paulus, and Marco J. Schutten. 2008. Time-constrained project scheduling. Journal of Scheduling 11, 2 (2008), 137--148. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Willy Herroelen, Erik Demeulemeester, and Bert De Reyck. 1999. A Classification Scheme for Project Scheduling. Springer US, Boston, MA, 1--26.Google ScholarGoogle Scholar
  13. Yuan-Yih Hsu and Chung-Ching Su. 1991. Dispatch of direct load control using dynamic programming. IEEE Transactions on Power Systems 6, 3 (Aug 1991), 1056--1061.Google ScholarGoogle Scholar
  14. Rainer Kolisch. 1996. Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research 90, 2 (1996), 320--333.Google ScholarGoogle ScholarCross RefCross Ref
  15. Thillainathan Logenthiran, Dipti Srinivasan, and Tan Z. Shun. 2012. Demand Side Management in Smart Grid Using Heuristic Optimization. IEEE Transactions on Smart Grid 3, 3 (Sep. 2012), 1244--1252.Google ScholarGoogle ScholarCross RefCross Ref
  16. Nicole Ludwig, Lukas Barth, Dorothea Wagner, and Veit Hagenmeyer. 2019. Industrial Demand-Side Flexibility: A Benchmark Data Set. In Proceedings of ACM e-Energy (e-Energy 2019). ACM, New York, NY, USA. (to appear).Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Nicole Ludwig, Simon Waczowicz, Ralf Mikut, and Veit Hagenmeyer. 2017. Mining flexibility patterns in energy time series from industrial processes. In Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23.-24. November 2017. KIT Scientific Publishing, 13.Google ScholarGoogle Scholar
  18. Rolf H. Möhring. 1984. Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time. Operations Research 32, 1 (1984), 89--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Mette K. Petersen, Lars H. Hansen, Jan Bendtsen, Kristian Edlund, and Jakob Stoustrup. 2014. Heuristic Optimization for the Discrete Virtual Power Plant Dispatch Problem. IEEE Transactions on Smart Grid 5, 6 (Nov 2014), 2910--2918.Google ScholarGoogle ScholarCross RefCross Ref
  20. Mohammad Ranjbar. 2013. A path-relinking metaheuristic for the resource levelling problem. Journal of the Operational Research Society 64, 7 (01 Jul 2013), 1071--1078.Google ScholarGoogle ScholarCross RefCross Ref
  21. Pierluigi Siano. 2014. Demand response and smart grids---A survey. Renewable and Sustainable Energy Reviews 30 (2014), 461--478.Google ScholarGoogle ScholarCross RefCross Ref
  22. U.S. Department of Energy. 2006. Benefits of demand response in electricity markets and recommendations for achieving them. (2006).Google ScholarGoogle Scholar
  23. Marc J. van Kreveld and Mark H. Overmars. 1993. Union-copy Structures and Dynamic Segment Trees. J. ACM 40, 3 (July 1993), 635--652. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. John S. Vardakas, Nizar Zorba, and Christos V. Verikoukis. 2015. A Survey on Demand Response Programs in Smart Grids: Pricing Methods and Optimization Algorithms. IEEE Communications Surveys Tutorials 17, 1 (Firstquarter 2015), 152--178.Google ScholarGoogle ScholarCross RefCross Ref
  25. Jan Weglarz. 2012. Project Scheduling: Recent Models, Algorithms and Applications. Springer US. https://books.google.de/books?id=uFDtBwAAQBAJGoogle ScholarGoogle Scholar
  26. Sean Yaw, Brendan Mumey, Erin McDonald, and Jennifer Lemke. 2014. Peak demand scheduling in the Smart Grid. In 2014 IEEE International Conference on Smart Grid Communications (SmartGridComm). 770--775.Google ScholarGoogle ScholarCross RefCross Ref
  27. Guosong Yu and Guochuan Zhang. 2009. Scheduling with a minimum number of machines. Operations Research Letters 37, 2 (2009), 97--101. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Shaving Peaks by Augmenting the Dependency Graph

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Other conferences
            e-Energy '19: Proceedings of the Tenth ACM International Conference on Future Energy Systems
            June 2019
            589 pages
            ISBN:9781450366717
            DOI:10.1145/3307772

            Copyright © 2019 ACM

            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 the author(s) 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: 15 June 2019

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed limited

            Acceptance Rates

            Overall Acceptance Rate160of446submissions,36%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader