The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Application of NSGA-II Algorithm to Generation Expansion Planning
Abstract
This paper describes use of a multiobjective optimization method, elitist nondominated sorting genetic algorithm version II (NSGA-II), to the generation expansion planning (GEP) problem. The proposed model provides for decision maker choice from among the different trade-off solutions. Two different problem formulations are considered. In one formulation, the first objective is to minimize cost; the second objective is to minimize sum of normalized constraint violations. In the other formulation, the first objective is to minimize investment cost; the second objective is to minimize outage cost (or maximize reliability). Virtual mapping procedure is introduced to improve the performance of NSGA-II. The GEP problem considered is a test system for a six-year planning horizon having five types of candidate units. The results are compared and validated.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
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
Cited by
Generation expansion planning optimisation with renewable energy integration: A review
Oree, V., Sayed Hassen, S. Z., & Fleming, P. J. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2016.11.120 · Cited by 297
Metadata
- Authors
- Kannan, S., Baskar, S., McCalley, J. D., & Murugan, P.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2009-02
- Volume
- 24
- Issue
- 1
- Pages
- 454-461
- ISSN
- 0885-8950 (ISSN-L)
- 1558-0679
- OpenAlex
- W2147437954
- Cited by
- 189
- References
- 2
- FWCI
- 5.98
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Application of NSGA-II Algorithm to Generation Expansion Planning. https://app.cochat.ai/papers/10.1109/tpwrs.2008.2004737
- The paper
- Kannan, S., Baskar, S., McCalley, J. D., & Murugan, P. (2009). Application of NSGA-II Algorithm to Generation Expansion Planning. IEEE Transactions on Power Systems. https://doi.org/10.1109/tpwrs.2008.2004737
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.