The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization
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
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,326
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_83 · Cited by 5,289
GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
Fonseca, C. M., & Fleming, P. J. (1993) · international conference on Genetic algorithms · Cited by 4,300
MOPSO: a proposal for multiple objective particle swarm optimization
Coello Coello, C. A., & Lechuga, M. S. (2002) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004388 · Cited by 2,437
A niched Pareto genetic algorithm for multiobjective optimization
Horn, J., Nafpliotis, N., & Goldberg, D. E. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.350037 · Cited by 2,433
Genetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
Particle swarm optimization method in multiobjective problems
Parsopoulos, K. E., & Vrahatis, M. N. (2002) · Proceedings of the 2002 ACM symposium on Applied computing · doi:10.1145/508791.508907 · Cited by 656
Multiobjective optimization using dynamic neighborhood particle swarm optimization
Hu, X., & Eberhart, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004494 · Cited by 613
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
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
Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
Coello Coello, C. A., & Reyes-Sierra, M. (2006) · International Journal of Computational Intelligence Research · doi:10.5019/j.ijcir.2006.68 · Cited by 1,365
Particle swarm optimization for feature selection in classification: a multi-objective approach
Xue, B., Zhang, M., & Browne, W. N. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2227469 · Cited by 1,282
Improving PSO-Based Multi-objective Optimization Using Crowding, Mutation and ∈-Dominance
Sierra, M. R., & Coello Coello, C. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31880-4_35 · Cited by 779
Metadata
- Authors
- Li, X.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 37-48
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1600188168
- Cited by
- 532
- References
- 10
- FWCI
- 6.53
- 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.