The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Multi-Objective Framework for Transmission Expansion Planning in Deregulated Environments
Abstract
Deregulation of power system has introduced new objectives and requirements for transmission expansion problem. In this paper, a static transmission expansion methodology is presented using a multi-objective optimization framework. Investment cost, reliability (both adequacy and security), and congestion cost are considered in the optimization as three objectives. To overcome the difficulties in solving the nonconvex and mixed integer nature of the optimization problems, the genetic based NSGA II algorithm is used followed by a fuzzy decision making analysis to obtain the final optimal solution. The planning methodology has been demonstrated on the IEEE 24-bus test system to show the feasibility and capabilities of the proposed algorithm. Also, in order to compare the historical expansion plan and the expansion plan developed by the proposed methodology, it was applied to the real life system of northeastern part of Iranian national 400-kV transmission grid.
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
Cited by
Genetic-Algorithm-Based Optimization Approach for Energy Management
Arabali, A., Ghofrani, M., Etezadi-Amoli, M., Fadali, M. S., & Baghzouz, Y. (2013) · IEEE Transactions on Power Delivery · doi:10.1109/tpwrd.2012.2219598 · Cited by 388
Yao, W., Zhao, J., Wen, F., Dong, Z., Xue, Y., Xu, Y., & Meng, K. (2014) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2296615 · Cited by 385
Shukla, A., Verma, K., & Kumar, R. (2019) · IET Generation, Transmission & Distribution · doi:10.1049/iet-gtd.2019.0486 · Cited by 119
Metadata
- Authors
- Maghouli, P., Hosseini, S. H., Buygi, M. O., & Shahidehpour, M.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2009-05
- Volume
- 24
- Issue
- 2
- Pages
- 1051-1061
- ISSN
- 0885-8950 (ISSN-L)
- 1558-0679
- OpenAlex
- W2098390373
- Cited by
- 213
- References
- 1
- FWCI
- 13.46
- 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.