The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Particle swarm optimization for integer programming
Abstract
The investigation of the performance of the particle swarm optimization (PSO) method in integer programming problems, is the main theme of the present paper. Three variants of PSO are compared with the widely used branch and bound technique, on several integer programming test problems. Results indicate that PSO handles efficiently such problems, and in most cases it outperforms the branch and bound technique.
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
Vetterling, W. T., Teukolsky, S. A., Press, W. H., & Flannery, B. P. (1988) · Cited by 7,701
Press, W. H., Teukolsky, S. L. A., Flannery, B. P., & Vetterling, W. T. (1990) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 6,980
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Engineering Optimization Theory and Practice
Rao, S. S. (2019) · Wiley eBooks · doi:10.1002/9781119454816 · Cited by 3,578
Parameter selection in particle swarm optimization
Shi, Y., & Eberhart, R. C. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040810 · Cited by 3,538
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Evolving artificial neural networks
Yao, X. (1999) · Proceedings of the IEEE · doi:10.1109/5.784219 · Cited by 2,981
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Fogel, D. B. (1995) · IEEE Press eBooks · Cited by 2,283
Schwefel, H. (1995) · Cited by 2,203
Cited by
Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients
Ratnaweera, A., Halgamuge, S. K., & Watson, H. C. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826071 · Cited by 3,034
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
Recent approaches to global optimization problems through Particle Swarm Optimization
Parsopoulos, K. E., & Vrahatis, M. N. (2002) · Natural Computing · doi:10.1023/a:1016568309421 · Cited by 1,406
Self-citationParticle Swarm Optimization Versus Genetic Algorithms for Phased Array Synthesis
Boeringer, D. W., & Werner, D. H. (2004) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2004.825102 · Cited by 945
Omran, M. G. H., & Mahdavi, M. (2008) · Applied Mathematics and Computation · doi:10.1016/j.amc.2007.09.004 · Cited by 753
On the Computation of All Global Minimizers Through Particle Swarm Optimization
Parsopoulos, K. E., & Vrahatis, M. N. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826076 · Cited by 681
Self-citationA review of particle swarm optimization. Part I: background and development
Banks, A., Vincent, J., & Anyakoha, C. (2007) · Natural Computing · doi:10.1007/s11047-007-9049-5 · Cited by 626
Sengupta, S., Basak, S., & Peters, R. (2018) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010010 · Cited by 543
An Energy-Aware Edge Server Placement Algorithm in Mobile Edge Computing
Li, Y., & Wang, S. (2018) · 2018 IEEE International Conference on Edge Computing (EDGE) · doi:10.1109/edge.2018.00016 · Cited by 273
Utilizing Evolutionary Computation Methods for the Design of S-Boxes
Laskari, E., Meletiou, G., & Vrahatis, M. (2006) · 2006 International Conference on Computational Intelligence and Security · doi:10.1109/iccias.2006.295267 · Cited by 29
Self-citationEmergency drug procurement planning based on big-data driven morbidity prediction
Song, Q., Zheng, Y.-J., Huang, Y.-J., Xu, Z.-G., Sheng, W.-G., & Yang, J. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2870879 · Cited by 24
Metadata
- Authors
- Laskari, E. C., Parsopoulos, K. E., & Vrahatis, M. N.
- Venue
- Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 2
- Pages
- 1582-1587
- OpenAlex
- W1913207580
- Cited by
- 299
- References
- 24
- FWCI
- 8.10
- 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.