2018 3rd International Conference on Intelligent Green Building and Smart Grid (IGBSG) 2018
DOI: 10.1109/igbsg.2018.8393518
|View full text |Cite
|
Sign up to set email alerts
|

Research on Solving Method of Security Constrained Unit Commitment Based on Improved Stochastic Constrained Ordinal Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
0
0
2

Year Published

2020
2020
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 3 publications
0
0
0
2
Order By: Relevance
“…To the best of our knowledge, there are few studies that address the computational complexity of the SSCUC problem and focus on solving the problem quickly and effectively. Among them, Wang and Fu [1] proposed a fully parallel stochastic SCUC approach to obtain efficient and fast solutions in large-scale electrical systems and N. Yang et al [25] proposed a method that aims to improve the efficiency of the SSCUC problem under constrained ordinal optimization (COO). This approach has two advantages: The first one is a recognition of discrete variables to reduce the solution space of the approximate COO rough model.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…To the best of our knowledge, there are few studies that address the computational complexity of the SSCUC problem and focus on solving the problem quickly and effectively. Among them, Wang and Fu [1] proposed a fully parallel stochastic SCUC approach to obtain efficient and fast solutions in large-scale electrical systems and N. Yang et al [25] proposed a method that aims to improve the efficiency of the SSCUC problem under constrained ordinal optimization (COO). This approach has two advantages: The first one is a recognition of discrete variables to reduce the solution space of the approximate COO rough model.…”
Section: Introductionmentioning
confidence: 99%
“…Following the authors of [1,25], in this work, we propose a novel and easy-to-implement strategy to efficiently solve a SSCUC problem under the uncertainty of large penetration of intermittent energy sources. This strategy has the following features: (i) it uses sensitivity linear factors to compute power flows to reduce the number of variables and constraints when compared to conventional network modeling; (ii) it considers user cuts to dynamically add active N − 1 security constraints, as proposed in [14]; and (iii) it uses the PHA decomposition algorithm to relax the SSCUC model.…”
Section: Introductionmentioning
confidence: 99%
“…Ref. [17] clustered and preprocessed the historical scheduling based on the K-means algorithm then constructed a deep learning model of unit combination based on long short-term memory network and proposed a data-driven intelligent decisionmaking method for unit combination with self-learning ability. Ref.…”
Section: Introductionmentioning
confidence: 99%
“…Hoy en día existe poca literatura que aborde de manera estratégica la complejidad computacional del SSCUC. En este sentido, en [13] se propone un procedimiento totalmente paralelizado para resolver el SSCUC obteniendo soluciones eficientes y rápidas en sistemas eléctricos a gran escala y en [14] se propone un método que apunta a mejorar la eficiencia del SSCUC bajo optimización ordinal restricta. Siguiendo el enfoque de investigación abordado en [13,14], en este trabajo se propone una estrategia para resolver eficientemente el SSCUC considerando la incertidumbre de fuentes de generación intermitentes.…”
Section: Introductionunclassified