Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 215

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Optimal Placement and Sizing of Distributed Generation via an Improved Nondominated Sorting Genetic Algorithm II

Sheng, Wanxing, Liu, Ke-yan, Liu, Yuan, Meng, Xiaoli, Li, Yunhua · 2015 · IEEE Transactions on Power Delivery

Abstract

An improved nondominated sorting genetic algorithm-II (INSGA-II) has been proposed for optimal planning of multiple distributed generation (DG) units in this paper. First, multiobjective functions that take minimum line loss, minimum voltage deviation, and maximal voltage stability margin into consideration have been formed. Then, using the proposed INSGA-II algorithm to solve the multiobjective planning problem has been described in detail. The improved sorting strategy and the novel truncation strategy based on hierarchical agglomerative clustering are utilized to keep the diversity of population. In order to strengthen the global optimal searching capability, the mutation and recombination strategies in differential evolution are introduced to replace the original one. In addition, a tradeoff method based on fuzzy set theory is used to obtain the best compromise solution from the Pareto-optimal set. Finally, several experiments have been made on the IEEE 33-bus test case and multiple actual test cases with the consideration of multiple DG units. The feasibility and effectiveness of the proposed algorithm for optimal placement and sizing of DG in distribution systems have been proved.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpwrd.2014.2325938

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Metadata

Authors
Sheng, W., Liu, K.-Y., Liu, Y., Meng, X., & Li, Y.
Venue
IEEE Transactions on Power Delivery
Published
2015-04
Volume
30
Issue
2
Pages
569-578
ISSN
  • 0885-8977 (ISSN-L)
  • 1937-4208
OpenAlex
W2077519535
Cited by
215
References
2
FWCI
9.02
Type
journal article
Language
en
Open access
closed

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.