IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v13y2020i18p4642-d409997.html
   My bibliography  Save this article

Data Driven Robust Energy and Reserve Dispatch Based on a Nonparametric Dirichlet Process Gaussian Mixture Model

Author

Listed:
  • Li Dai

    (State Key Laboratory of Advanced Electromagnetic Engineering and Technology, School of Electrical and Electronic Engineering, Huazhong University of Science and Technology, No.1037, Luoyu Road, Wuhan 430074, China)

  • Dahai You

    (State Key Laboratory of Advanced Electromagnetic Engineering and Technology, School of Electrical and Electronic Engineering, Huazhong University of Science and Technology, No.1037, Luoyu Road, Wuhan 430074, China)

  • Xianggen Yin

    (State Key Laboratory of Advanced Electromagnetic Engineering and Technology, School of Electrical and Electronic Engineering, Huazhong University of Science and Technology, No.1037, Luoyu Road, Wuhan 430074, China)

Abstract

Traditional robust optimization methods use box uncertainty sets or gamma uncertainty sets to describe wind power uncertainty. However, these uncertainty sets fail to utilize wind forecast error probability information and assume that the wind forecast error is symmetrical and independent. This assumption is not reasonable and makes the optimization results conservative. To avoid such conservative results from traditional robust optimization methods, in this paper a novel data driven optimization method based on the nonparametric Dirichlet process Gaussian mixture model (DPGMM) was proposed to solve energy and reserve dispatch problems. First, we combined the DPGMM and variation inference algorithm to extract the GMM parameter information embedded within historical data. Based on the parameter information, a data driven polyhedral uncertainty set was proposed. After constructing the uncertainty set, we solved the robust energy and reserve problem. Finally, a column and constraint generation method was employed to solve the proposed data driven optimization method. We used real historical wind power forecast error data to test the performance of the proposed uncertainty set. The simulation results indicated that the proposed uncertainty set had a smaller volume than other data driven uncertainty sets with the same predefined coverage rate. Furthermore, the simulation was carried on PJM 5-bus and IEEE-118 bus systems to test the data driven optimization method. The simulation results demonstrated that the proposed optimization method was less conservative than traditional data driven robust optimization methods and distributionally robust optimization methods.

Suggested Citation

  • Li Dai & Dahai You & Xianggen Yin, 2020. "Data Driven Robust Energy and Reserve Dispatch Based on a Nonparametric Dirichlet Process Gaussian Mixture Model," Energies, MDPI, vol. 13(18), pages 1-18, September.
  • Handle: RePEc:gam:jeners:v:13:y:2020:i:18:p:4642-:d:409997
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/13/18/4642/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/13/18/4642/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Teh, Yee Whye & Jordan, Michael I. & Beal, Matthew J. & Blei, David M., 2006. "Hierarchical Dirichlet Processes," Journal of the American Statistical Association, American Statistical Association, vol. 101, pages 1566-1581, December.
    2. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    3. Chen, Yue & Wei, Wei & Liu, Feng & Mei, Shengwei, 2016. "Distributionally robust hydro-thermal-wind economic dispatch," Applied Energy, Elsevier, vol. 173(C), pages 511-519.
    4. Li, Zhigang & Qiu, Feng & Wang, Jianhui, 2016. "Data-driven real-time power dispatch for maximizing variable renewable generation," Applied Energy, Elsevier, vol. 170(C), pages 304-313.
    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. Yang, Hongming & Liang, Rui & Yuan, Yuan & Chen, Bowen & Xiang, Sheng & Liu, Junpeng & Zhao, Huan & Ackom, Emmanuel, 2022. "Distributionally robust optimal dispatch in the power system with high penetration of wind power based on net load fluctuation data," Applied Energy, Elsevier, vol. 313(C).
    2. Xi, Lei & Yu, Tao & Yang, Bo & Zhang, Xiaoshun & Qiu, Xuanyu, 2016. "A wolf pack hunting strategy based virtual tribes control for automatic generation control of smart grid," Applied Energy, Elsevier, vol. 178(C), pages 198-211.
    3. Michelle Dietzen & Haoran Zhai & Olivia Lucas & Oriol Pich & Christopher Barrington & Wei-Ting Lu & Sophia Ward & Yanping Guo & Robert E. Hynds & Simone Zaccaria & Charles Swanton & Nicholas McGranaha, 2024. "Replication timing alterations are associated with mutation acquisition during breast and lung cancer evolution," Nature Communications, Nature, vol. 15(1), pages 1-23, December.
    4. Redivo, Edoardo & Nguyen, Hien D. & Gupta, Mayetri, 2020. "Bayesian clustering of skewed and multimodal data using geometric skewed normal distributions," Computational Statistics & Data Analysis, Elsevier, vol. 152(C).
    5. Mohagheghi, Erfan & Gabash, Aouss & Alramlawi, Mansour & Li, Pu, 2018. "Real-time optimal power flow with reactive power dispatch of wind stations using a reconciliation algorithm," Renewable Energy, Elsevier, vol. 126(C), pages 509-523.
    6. Mika Meitz, 2024. "Statistical inference for generative adversarial networks and other minimax problems," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 51(3), pages 1323-1356, September.
    7. Soonhui Lee & Tito Homem-de-Mello & Anton Kleywegt, 2012. "Newsvendor-type models with decision-dependent uncertainty," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 189-221, October.
    8. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    9. Jeffrey L. Furman & Florenta Teodoridis, 2020. "Automation, Research Technology, and Researchers’ Trajectories: Evidence from Computer Science and Electrical Engineering," Organization Science, INFORMS, vol. 31(2), pages 330-354, March.
    10. Jiang, Sheng-Long & Wang, Meihong & Bogle, I. David L., 2023. "Plant-wide byproduct gas distribution under uncertainty in iron and steel industry via quantile forecasting and robust optimization," Applied Energy, Elsevier, vol. 350(C).
    11. Çağıl Koçyiğit & Daniel Kuhn & Napat Rujeerapaiboon, 2024. "Regret Minimization and Separation in Multi-Bidder, Multi-Item Auctions," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1543-1561, December.
    12. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    13. Manish Bansal & Yingqiu Zhang, 2021. "Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs," Journal of Global Optimization, Springer, vol. 81(2), pages 391-433, October.
    14. Ken Kobayashi & Yuichi Takano & Kazuhide Nakata, 2021. "Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 493-528, October.
    15. Shu-Ping Shi & Yong Song, 2012. "Identifying Speculative Bubbles with an Infinite Hidden Markov Model," Working Paper series 26_12, Rimini Centre for Economic Analysis.
    16. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    17. Jin, Xin & Maheu, John M. & Yang, Qiao, 2022. "Infinite Markov pooling of predictive distributions," Journal of Econometrics, Elsevier, vol. 228(2), pages 302-321.
    18. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    19. Gustaf Bellstam & Sanjai Bhagat & J. Anthony Cookson, 2021. "A Text-Based Analysis of Corporate Innovation," Management Science, INFORMS, vol. 67(7), pages 4004-4031, July.
    20. Ruidi Chen & Ioannis Ch. Paschalidis, 2022. "Robust Grouped Variable Selection Using Distributionally Robust Optimization," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 1042-1071, September.

    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:gam:jeners:v:13:y:2020:i:18:p:4642-:d:409997. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.