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

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

Ant Colony System Algorithm for the Planning of Primary Distribution Circuits

Gomez, J.F., Khodr, H.M., DeOliveira, P.M., Ocque, L., Yusta, J.M., Villasana, R., Urdaneta, A.J. · 2004 · IEEE Transactions on Power Systems

Abstract

The planning problem of electrical power distribution networks, stated as a mixed nonlinear integer optimization problem, is solved using the ant colony system algorithm (ACS). The behavior of real ants has inspired the development of the ACS algorithm, an improved version of the ant system (AS) algorithm, which reproduces the technique used by ants to construct their food recollection routes from their nest, and where a set of artificial ants cooperate to find the best solution through the interchange of the information contained in the pheromone deposits of the different trajectories. This metaheuristic approach has proven to be very robust when applied to global optimization problems of a combinatorial nature, such as the traveling salesman and the quadratic assignment problem, and is favorably compared to other solution approaches such as genetic algorithms (GAs) and simulated annealing techniques. In this work, the ACS methodology is coupled with a conventional distribution system load-flow algorithm and adapted to solve the primary distribution system planning problem. The application of the proposed methodology to two real cases is presented: a 34.5-kV system with 23 nodes from the oil industry and a more complex 10-kV electrical distribution system with 201 nodes that feeds an urban area. The performance of the proposed approach outstands positively when compared to GAs, obtaining improved results with significant reductions in the solution time. The technique is shown as a flexible and powerful tool for the distribution system planning engineers.

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/tpwrs.2004.825867

Cites

5 of 5 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

Cited by

See all 275

Metadata

Authors
Gomez, J. F., Khodr, H. M., DeOliveira, P. M., Ocque, L., Yusta, J. M., Villasana, R., & Urdaneta, A. J.
Venue
IEEE Transactions on Power Systems
Published
2004-05
Volume
19
Issue
2
Pages
996-1004
ISSN
0885-8950 (ISSN-L)
OpenAlex
W2115637931
Cited by
275
References
5
FWCI
7.52
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.