IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v69y2023i5p2788-2813.html
   My bibliography  Save this article

Peak-Load Energy Management by Direct Load Control Contracts

Author

Listed:
  • Ali Fattahi

    (Carey Business School, Johns Hopkins University, Baltimore, Maryland 21202)

  • Sriram Dasu

    (Marshall School of Business, University of Southern California, Los Angeles, California 90089)

  • Reza Ahmadi

    (Anderson School of Management, University of California–Los Angeles, Los Angeles, California 90095)

Abstract

We study direct load control contracts that utilities use to curtail customers’ electricity consumption during peak-load periods. These contracts place limits on the number of calls and total number of hours of power reduction per customer per year as well as the duration of each call. The stochastic dynamic program that determines how many customers to call and the timing and duration of each call for each day is an extremely difficult (NP-hard) optimization problem. We design a scenario-based approximation method to generate probabilistic allocation polices in a reasonable amount of time. Our approach consists of three approximations: deterministic approximation of demand, discretization of the expected demand, and aggregation/disaggregation of the resources. We show the relative information error resulting from the deterministic approximation is O ( 1 / n ) , the discretization error is O ( 1 / n ) , and the aggregation/disaggregation error is O ( 1 / n ) , where n represents the length of the horizon. Finally, we show the total relative error is O ( 1 / n ) . Our error analysis establishes that our approximation method is near optimal . In addition, our extensive numerical experiments verify the high quality of our approximation approach. The error, conservatively measured, is quite small and has an average and standard deviation of 8.6% and 1.4%, respectively. We apply our solution approach to the data provided by three major utility companies in California. Overall, our study shows our procedure improves the savings in energy-generation cost by 37.7% relative to current practices.

Suggested Citation

  • Ali Fattahi & Sriram Dasu & Reza Ahmadi, 2023. "Peak-Load Energy Management by Direct Load Control Contracts," Management Science, INFORMS, vol. 69(5), pages 2788-2813, May.
  • Handle: RePEc:inm:ormnsc:v:69:y:2023:i:5:p:2788-2813
    DOI: 10.1287/mnsc.2022.4493
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2022.4493
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2022.4493?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. William L. Cooper, 2002. "Asymptotic Behavior of an Allocation Policy for Revenue Management," Operations Research, INFORMS, vol. 50(4), pages 720-727, August.
    2. Paul H. Zipkin, 1980. "Bounds on the Effect of Aggregating Variables in Linear Programs," Operations Research, INFORMS, vol. 28(2), pages 403-418, April.
    3. Doostizadeh, Meysam & Ghasemi, Hassan, 2012. "A day-ahead electricity pricing model based on smart metering and demand-side management," Energy, Elsevier, vol. 46(1), pages 221-230.
    4. Ross Baldick & Sergey Kolos & Stathis Tompaidis, 2006. "Interruptible Electricity Contracts from an Electricity Retailer's Point of View: Valuation and Optimal Interruption," Operations Research, INFORMS, vol. 54(4), pages 627-642, August.
    5. Ericson, Torgeir, 2009. "Direct load control of residential water heaters," Energy Policy, Elsevier, vol. 37(9), pages 3502-3512, September.
    6. Qian Liu & Garrett van Ryzin, 2008. "On the Choice-Based Linear Programming Model for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 288-310, October.
    7. Dan Zhang & Daniel Adelman, 2009. "An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice," Transportation Science, INFORMS, vol. 43(3), pages 381-394, August.
    8. Aghaei, Jamshid & Alizadeh, Mohammad-Iman, 2013. "Demand response in smart electricity grids equipped with renewable energy sources: A review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 18(C), pages 64-72.
    9. Haider, Haider Tarish & See, Ong Hang & Elmenreich, Wilfried, 2016. "A review of residential demand response of smart grid," Renewable and Sustainable Energy Reviews, Elsevier, vol. 59(C), pages 166-178.
    10. Benjamin Van Roy, 2006. "Performance Loss Bounds for Approximate Value Iteration with State Aggregation," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 234-244, May.
    11. Daniel Adelman, 2007. "Dynamic Bid Prices in Revenue Management," Operations Research, INFORMS, vol. 55(4), pages 647-661, August.
    12. Faruqui, Ahmad & Hledik, Ryan & Tsoukalis, John, 2009. "The Power of Dynamic Pricing," The Electricity Journal, Elsevier, vol. 22(3), pages 42-56, April.
    13. James C. Bean & John R. Birge & Robert L. Smith, 1987. "Aggregation in Dynamic Programming," Operations Research, INFORMS, vol. 35(2), pages 215-220, April.
    14. Rajnish Kamat & Shmuel S. Oren, 2002. "Exotic Options for Interruptible Electricity Supply Contracts," Operations Research, INFORMS, vol. 50(5), pages 835-850, October.
    15. Wissner, Matthias, 2011. "The Smart Grid - A saucerful of secrets?," Applied Energy, Elsevier, vol. 88(7), pages 2509-2518, July.
    16. Heikki Peura & Derek W. Bunn, 2015. "Dynamic Pricing of Peak Production," Operations Research, INFORMS, vol. 63(6), pages 1262-1279, December.
    17. Saed Alizamir & Francis de Véricourt & Peng Sun, 2016. "Efficient Feed-In-Tariff Policies for Renewable Energy Technologies," Operations Research, INFORMS, vol. 64(1), pages 52-66, February.
    18. Paul H. Zipkin, 1980. "Bounds for Row-Aggregation in Linear Programming," Operations Research, INFORMS, vol. 28(4), pages 903-916, August.
    19. Roy Mendelssohn, 1982. "An Iterative Aggregation Procedure for Markov Decision Processes," Operations Research, INFORMS, vol. 30(1), pages 62-73, February.
    20. Shabbir Ahmed & Nikolaos V. Sahinidis, 2003. "An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion," Operations Research, INFORMS, vol. 51(3), pages 461-471, June.
    21. Shmuel S. Oren & Stephen A. Smith, 1992. "Design and Management of Curtailable Electricity Service to Reduce Annual Peaks," Operations Research, INFORMS, vol. 40(2), pages 213-228, April.
    22. David F. Rogers & Robert D. Plante & Richard T. Wong & James R. Evans, 1991. "Aggregation and Disaggregation Techniques and Methodology in Optimization," Operations Research, INFORMS, vol. 39(4), pages 553-582, August.
    23. Ward Whitt, 1978. "Approximations of Dynamic Programs, I," Mathematics of Operations Research, INFORMS, vol. 3(3), pages 231-243, August.
    24. Stefanus Jasin & Sunil Kumar, 2012. "A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 313-345, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chevalier, Philippe & Lamas, Alejandro & Lu, Liang & Mlinar, Tanja, 2015. "Revenue management for operations with urgent orders," European Journal of Operational Research, Elsevier, vol. 240(2), pages 476-487.
    2. Yuhang Ma & Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals," Operations Research, INFORMS, vol. 68(3), pages 834-855, May.
    3. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    4. Murwan Siddig & Yongjia Song, 2022. "Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse," Computational Optimization and Applications, Springer, vol. 81(1), pages 201-250, January.
    5. Dan Zhang, 2011. "An Improved Dynamic Programming Decomposition Approach for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 35-52, April.
    6. Stefanus Jasin & Sunil Kumar, 2012. "A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 313-345, May.
    7. Dan Zhang & Zhaosong Lu, 2013. "Assessing the Value of Dynamic Pricing in Network Revenue Management," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 102-115, February.
    8. Zizhuo Wang & Yinyu Ye, 2016. "Hidden-City Ticketing: The Cause and Impact," Transportation Science, INFORMS, vol. 50(1), pages 288-305, February.
    9. Dan Zhang & Larry Weatherford, 2017. "Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 18-35, February.
    10. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
    11. Michael Z. Spivey & Warren B. Powell, 2004. "The Dynamic Assignment Problem," Transportation Science, INFORMS, vol. 38(4), pages 399-419, November.
    12. Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
    13. Meyabadi, A. Fattahi & Deihimi, M.H., 2017. "A review of demand-side management: Reconsidering theoretical framework," Renewable and Sustainable Energy Reviews, Elsevier, vol. 80(C), pages 367-379.
    14. Merrick, James H. & Weyant, John P., 2019. "On choosing the resolution of normative models," European Journal of Operational Research, Elsevier, vol. 279(2), pages 511-523.
    15. Srinivasa, Anand V. & Wilhelm, Wilbert E., 1997. "A procedure for optimizing tactical response in oil spill clean up operations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 554-574, November.
    16. Sumit Kunnumkal & Kalyan Talluri, 2016. "Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program," Operations Research, INFORMS, vol. 64(1), pages 158-166, February.
    17. Wuyang Yuan & Lei Nie & Xin Wu & Huiling Fu, 2018. "A dynamic bid price approach for the seat inventory control problem in railway networks with consideration of passenger transfer," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-23, August.
    18. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    19. Stefanus Jasin & Amitabh Sinha, 2015. "An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment," Operations Research, INFORMS, vol. 63(6), pages 1336-1351, December.
    20. Nicolas Houy & François Le Grand, 2015. "The Monte Carlo first-come-first-served heuristic for network revenue management," Working Papers halshs-01155698, HAL.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:69:y:2023:i:5:p:2788-2813. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.