The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Multiobjective optimization using dynamic neighborhood particle swarm optimization
Abstract
This paper presents a particle swarm optimization (PSO) algorithm for multiobjective optimization problems. PSO is modified by using a dynamic neighborhood strategy, new particle memory updating, and one-dimension optimization to deal with multiple objectives. Several benchmark cases were tested and showed that PSO could efficiently find multiple Pareto optimal solutions.
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
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
Self-citationA 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
Self-citationA 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
Self-citationComparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
An Overview of Evolutionary Algorithms in Multiobjective Optimization
Fonseca, C. M., & Fleming, P. J. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.1.1 · Cited by 2,266
Evolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques
Coello Coello, C. A. (1999) · Knowledge and Information Systems · doi:10.1007/bf03325101 · Cited by 1,367
Tracking and optimizing dynamic systems with particle swarms
Eberhart, R. C., & Shi, Y. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934376 · Cited by 1,013
Self-citationA multi-sexual genetic algorithm for multiobjective optimization
Lis, J., & Eiben, A. E. (2002) · IEEE International Conference on Evolutionary Computation (ICEC) · doi:10.1109/icec.1997.592269 · Cited by 112
Cited by
Handling multiple objectives with particle swarm optimization
Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826067 · Cited by 4,455
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems
del Valle, Y., Venayagamoorthy, G. K., Mohagheghi, S., Hernandez, J.-C., & Harley, R. G. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.896686 · Cited by 2,277
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
Clerc, M. (2006) · Wiley eBooks · doi:10.1002/9780470612163 · Cited by 1,622
Metadata
- Authors
- Hu, X., & Eberhart, R.
- Venue
- Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 2
- Pages
- 1677-1681
- OpenAlex
- W2157601049
- Cited by
- 613
- References
- 9
- FWCI
- 18.13
- Type
- conference paper
- 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.