The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Combining of chaotic differential evolution and quadratic programming for economic dispatch optimization with valve-point effect
Abstract
Evolutionary algorithms are heuristic methods that have yielded promising results for solving nonlinear, nondifferentiable, and multi-modal optimization problems in the power systems area. The differential evolution (DE) algorithm is an evolutionary algorithm that uses a rather greedy and less stochastic approach to problem solving than do classical evolutionary algorithms, such as genetic algorithms, evolutionary programming, and evolution strategies. DE also incorporates an efficient way of self-adapting mutation using small populations. The potentialities of DE are its simple structure, easy use, convergence property, quality of solution, and robustness. This paper proposes a new approach for solving economic load dispatch problems with valve-point effect. The proposed method combines the DE algorithm with the generator of chaos sequences and sequential quadratic programming (SQP) technique to optimize the performance of economic dispatch problems. The DE with chaos sequences is the global optimizer, and the SQP is used to fine-tune the DE run in a sequential manner. The combined methodology and its variants are validated for two test systems consisting of 13 and 40 thermal units whose incremental fuel cost function takes into account the valve-point loading effects. The proposed combined method outperforms other state-of-the-art algorithms in solving load dispatch problems with the valve-point effect.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Power Generation, Operation, and Control
Wood, A. J., & Wollenberg, B. F. (1984) · Cited by 8,303
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001
Price, K. V. (2004) · Cited by 3,344
Storn, R. (1995) · Medical Entomology and Zoology · Cited by 2,800
Evolutionary Algorithms for Constrained Parameter Optimization Problems
Michalewicz, Z., & Schoenauer, M. (1996) · Evolutionary Computation · doi:10.1162/evco.1996.4.1.1 · Cited by 1,718
Hill, P. G. (1977) · Cited by 1,394
Evolutionary programming techniques for economic load dispatch
Sinha, N., Chakrabarti, R., & Chattopadhyay, P. K. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.806788 · Cited by 1,270
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
An Improved Particle Swarm Optimization for Nonconvex Economic Dispatch Problems
Park, J.-B., Jeong, Y.-W., Shin, J.-R., & Lee, K. Y. (2010) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2009.2030293 · Cited by 627
Differential evolution for economic load dispatch problems
Noman, N., & Iba, H. (2008) · Electric Power Systems Research · doi:10.1016/j.epsr.2007.11.007 · Cited by 481
Kothari, D. P. (2012) · 2012 2nd National Conference on Computational Intelligence and Signal Processing (CISP) · doi:10.1109/nccisp.2012.6189669 · Cited by 402
Chaotic Local Search-Based Differential Evolution Algorithms for Optimization
Gao, S., Yu, Y., Wang, Y., Wang, J., Cheng, J., & Zhou, M. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2019.2956121 · Cited by 368
Chaotic grasshopper optimization algorithm for global optimization
Arora, S., & Anand, P. (2019) · Neural Computing and Applications · doi:10.1007/s00521-018-3343-2 · Cited by 350
Optimal Dispatch of Electric Vehicles and Wind Power Using Enhanced Particle Swarm Optimization
Zhao, J., Wen, F., Dong, Z. Y., Xue, Y., & Wong, K. P. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2205398 · Cited by 283
Wang, J., Li, L., Niu, D., & Tan, Z. (2012) · Applied Energy · doi:10.1016/j.apenergy.2012.01.010 · Cited by 257
Metadata
- Authors
- Coelho, L. S., & Mariani, V. C.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2006-05
- Volume
- 21
- Issue
- 2
- Pages
- 989-996
- ISSN
- 0885-8950 (ISSN-L)
- 1558-0679
- OpenAlex
- W2165655609
- Cited by
- 597
- References
- 23
- FWCI
- 24.63
- 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.