The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A Modified Particle Swarm Optimizer for the Coordination of Directional Overcurrent Relays
Abstract
The coordination of directional overcurrent relays (DOCR) is treated in this paper using particle swarm optimization (PSO), a recently proposed optimizer that utilizes the swarm behavior in searching for an optimum. PSO gained a lot of interest for its simplicity, robustness, and easy implementation. The problem of setting DOCR is a highly constrained optimization problem that has been stated and solved as a linear programming (LP) problem. To deal with such constraints a modification to the standard PSO algorithm is introduced. Three case studies are presented, and the results are compared to those of LP technique to demonstrate the effectiveness of the proposed methodology.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 1×
“PSO has been recently adopted by a lot of researchers due to its superiority to other evolutionary algorithms (EA) regarding its memory, and computational time requirements as it relies on very simple mathematical operations, also it requires very few lines of computer code to implement [12].”
BackgroundA modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
Particle swarm optimization in electromagnetics
Robinson, J., & Rahmat-Samii, Y. (2004) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2004.823969 · Cited by 2,265
An analysis of particle swarm optimizers
van den Bergh, F., & Engelbrecht, A. P. (2002) · UpSpace Institutional Repository (University of Pretoria) · Cited by 1,618
Linear Programming: Foundations and Extensions
Vanderbei, R. J. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600987 · Cited by 916
Cited by
Zeineldin, H. H., Sharaf, H. M., Ibrahim, D. K., & El-Zahab, E. E.-D. A. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2014.2357813 · Cited by 266
Metadata
- Authors
- Mansour, M. M., Mekhamer, S. F., & El-Kharbawe, N.
- Venue
- IEEE Transactions on Power Delivery
- Published
- 2007-07
- Volume
- 22
- Issue
- 3
- Pages
- 1400-1410
- ISSN
- 0885-8977 (ISSN-L)
- OpenAlex
- W2045434012
- Cited by
- 347
- References
- 6
- FWCI
- 9.32
- 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.