The DOI matches its Crossref record.
Optimal Power Flow Using Tabu Search Algorithm
Abstract
This paper presents an efficient and reliable tabu search (TS)-based approach to solve the optimal power flow (OPF) problem. The proposed approach employs TS algorithm for optimal settings of the control variables of the OPF problem. Incorporation of TS as a derivative-free optimization technique in solving OPF problem significantly reduces the computational burden. One of the main advantages of TS algorithm is its robustness to its own parameter settings as well as the initial solution. In addition, TS is characterized by its ability to avoid entrapment in local optimal solution and prevent cycling by using flexible memory of search history. The proposed approach has been examined on the standard IEEE 30-bus test system with different objectives and generator cost curves. The results are promising and show the effectiveness and robustness of the proposed approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Optimal power flow: a bibliographic survey I: Formulations and deterministic methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0056-y · Cited by 554
Sedghi, M., Ahmadian, A., & Aliakbar-Golkar, M. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2404533 · Cited by 422
Maleki, A., & Askarzadeh, A. (2014) · International Journal of Hydrogen Energy · doi:10.1016/j.ijhydene.2014.04.147 · Cited by 270
A novel hybrid GWO-SCA approach for optimization problems
Singh, N., & Singh, S. B. (2017) · Engineering Science and Technology, an International Journal · doi:10.1016/j.jestch.2017.11.001 · Cited by 214
Voltage Optimization in PV-Rich Distribution Networks—A Review
Dubravac, M., Fekete, K., Topić, D., & Barukčić, M. (2022) · Applied Sciences · doi:10.3390/app122312426 · Cited by 26
Metadata
- Authors
- Abido, M. A.
- Venue
- Electric Power Components and Systems
- Publisher
- Informa UK Limited
- Published
- 2002-05
- Volume
- 30
- Issue
- 5
- Pages
- 469-483
- ISSN
- 1532-5008 (ISSN-L)
- 1532-5016
- OpenAlex
- W2109242547
- Cited by
- 414
- References
- 0
- FWCI
- 1.75
- 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: Optimal Power Flow Using Tabu Search Algorithm. https://app.cochat.ai/papers/10.1080/15325000252888425
- The paper
- Abido, M. A. (2002). Optimal Power Flow Using Tabu Search Algorithm. Electric Power Components and Systems. https://doi.org/10.1080/15325000252888425
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.
