The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Optimal reactive power dispatch with uncertainties in load demand and renewable energy sources adopting scenario-based approach
Open accessAbstract
Abstract Optimizing reactive power flow in electrical network is an important aspect of system study as the reactive power supports network voltage which needs to be maintained within desirable limits for system reliability. A network consisting of only conventional thermal generators has been extensively studied for optimal active and reactive power dispatch. However, increasing penetration of renewable sources into the grid necessitates power flow studies incorporating these sources. This paper presents a formulation and solution procedure for stochastic optimal reactive power dispatch (ORPD) problem with uncertainties in load demand, wind and solar power. Appropriate probability density functions (PDFs) are considered to model the stochastic load demand and the power generated from the renewable energy sources. Numerous scenarios are created running Monte-Carlo simulation and scenario reduction technique is implemented to deal with reduced number of scenarios. Real power loss and steady state voltage deviation of load buses in the network are set as the objectives of optimization. Success history based adaptive differential evolution (SHADE) is adopted as the basic search algorithm. SHADE has been successfully integrated with a constraint handling technique, called epsilon constraint (EC) handling, to handle constraints in ORPD problem. The effectiveness of a proper constraint handling technique is substantiated with case studies for deterministic ORPD on base configurations of IEEE 30-bus and 57-bus systems using SHADE-EC algorithm. The single-objective and multi-objective stochastic ORPD cases are also solved using the SHADE-EC algorithm. The results are discussed, compared and critically analyzed in this study.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Differential evolution algorithm with ensemble of parameters and mutation strategies
Mallipeddi, R., Suganthan, P. N., Pan, Q. K., & Tasgetiren, M. F. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2010.04.024 · Cited by 1,362
Self-citationBiswas, P. P., Suganthan, P. N., Wu, G., & Amaratunga, G. A. J. (2019) · Renewable Energy · doi:10.1016/j.renene.2018.07.152 · Cited by 190
Self-citation
Cited by
A particle swarm optimization algorithm for mixed-variable optimization problems
Wang, F., Zhang, H., & Zhou, A. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100808 · Cited by 321
Metadata
- Authors
- Biswas, P. P., Suganthan, P. N., Mallipeddi, R., & Amaratunga, G. A. J.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2019-02
- Volume
- 75
- Pages
- 616-632
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2904025191
- Cited by
- 238
- References
- 3
- FWCI
- 7.06
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.