The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
Abstract
Particle swarm optimization (PSO) is predominately used to find solutions for continuous optimization problems. As the operators of PSO are originally designed in ann-dimensional continuous space, the advancement of using PSO to find solutions in a discrete space is at a slow pace. In this paper, a novel set-based PSO (S-PSO) method for the solutions of some combinatorial optimization problems (COPs) in discrete space is presented. The proposed S-PSO features the following characteristics. First, it is based on using a set-based representation scheme that enables S-PSO to characterize the discrete search space of COPs. Second, the candidate solution and velocity are defined as a crisp set, and a set with possibilities, respectively. All arithmetic operators in the velocity and position updating rules used in the original PSO are replaced by the operators and procedures defined on crisp sets, and sets with possibilities in S-PSO. The S-PSO method can thus follow a similar structure to the original PSO for searching in a discrete space. Based on the proposed S-PSO method, most of the existing PSO variants, such as the global version PSO, the local version PSO with different topologies, and the comprehensive learning PSO (CLPSO), can be extended to their corresponding discrete versions. These discrete PSO versions based on S-PSO are tested on two famous COPs: the traveling salesman problem and the multidimensional knapsack problem. Experimental results show that the discrete version of the CLPSO algorithm based on S-PSO is promising.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
A 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-citationThe particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
Particle swarm optimization: developments, applications and resources
Eberhart, & Shi, Y. (2001) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934374 · Cited by 4,310
Self-citationAn Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
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
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
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
A Cooperative Approach to Particle Swarm Optimization
vandenBergh, F., & Engelbrecht, A. P. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826069 · Cited by 2,120
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
Introduction to Algorithms, Second Edition
Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984
Population structure and particle swarm performance
Kennedy, J., & Mendes, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004493 · Cited by 1,586
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
Han, K.-H., & Kim, J.-H. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.804320 · Cited by 1,585
(2004) · Lecture Notes in Computer Science · doi:10.1007/b99492 · Cited by 1,511
Ranjith Kumar, A., & Ranjith Kumar, R. (2011) · Cited by 1,225
Fuzzy adaptive particle swarm optimization
Shi, Y., & Eberhart, R. C. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934377 · Cited by 1,071
Self-citationSmall worlds and mega-minds: effects of neighborhood topology on particle swarm performance
Kennedy, J. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785509 · Cited by 1,061
MAX-MIN Ant System and local search for the traveling salesman problem
Stutzle, T., & Hoos, H. (2002) · Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) · doi:10.1109/icec.1997.592327 · Cited by 831
A Genetic Algorithm for the Multidimensional Knapsack Problem
Chu, P. C., & Beasley, J. E. (1998) · Journal of Heuristics · doi:10.1023/a:1009642405419 · Cited by 828
The traveling salesman: computational solutions for TSP applications
Reinelt, G. (1994) · Cited by 720
A discrete version of particle swarm optimization for flowshop scheduling problems
Liao, C.-J., Tseng, C.-T., & Luarn, P. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.11.017 · Cited by 445
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Pan, Q.-K., Fatih Tasgetiren, M., & Liang, Y.-C. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2006.12.030 · Cited by 445
Hybrid Particle Swarm Optimiser with breeding and subpopulations
Løvbjerg, M., Rasmussen, T., & Krink, T. (2001) · Cited by 429
Particle swarm optimization for traveling salesman problem
Wang, K.-P., Huang, L., Zhou, C.-G., & Pang, W. (2004) · Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693) · doi:10.1109/icmlc.2003.1259748 · Cited by 408
A new version of ant system for subset problems
Leguizamon, G., & Michalewicz, Z. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.782655 · Cited by 215
Edge Assembly Crossover.A High-power Genetic Algorithm for the Traveling Salesman Problem
Nagata, Y. (1997) · international conference on Genetic algorithms · Cited by 189
A novel quantum swarm evolutionary algorithm and its applications
Wang, Y., Feng, X.-Y., Huang, Y.-X., Pu, D.-B., Zhou, W.-G., Liang, Y.-C., & Zhou, C.-G. (2007) · Neurocomputing · doi:10.1016/j.neucom.2006.10.001 · Cited by 170
New genetic local search operators for the traveling salesman problem
Freisleben, B., & Merz, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_1052 · Cited by 167
Jin, Y.-X., Cheng, H.-Z., Yan, J.-Y., & Zhang, L. (2007) · Electric Power Systems Research · doi:10.1016/j.epsr.2006.02.016 · Cited by 167
Fuzzy discrete particle swarm optimization for solving traveling salesman problem
Pang, W., Wang, K., Zhou, C., & Dong, L.-J. (2004) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2004.1357292 · Cited by 161
Lian, Z., Gu, X., & Jiao, B. (2006) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2006.05.082 · Cited by 153
Don't push me! Collision-avoiding swarms
Blackwell, T., & Bentley, P. J. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2002.1004497 · Cited by 146
Combining Particle Swarm Optimisation with angle modulation to solve binary problems
Pamparà, G., Franken, N., & Engelbrecht, A. P. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2005.1554671 · Cited by 131
A Novel Binary Particle Swarm Optimization Method Using Artificial Immune System
Afshinmanesh, F., Marandi, A., & Rahimi‐Kian, A. (2005) · IEEE EUROCON - International Conference on Computer as a Tool (EUROCON) · doi:10.1109/eurcon.2005.1629899 · Cited by 114
A novel discrete particle swarm optimization to solve traveling salesman problem
Zhong, W.-H., Zhang, J., & Chen, W. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4424894 · Cited by 107
Self-citationPang, W., Wang, K., Zhou, C., Dong, L.-J., Liu, M., Zhang, H., & Wang, J. (2005) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2004.1382191 · Cited by 62
Ant algorithm for the multi-dimensional knapsack problem
Alaya, I., Solnon, C., & Ghédira, K. (2004) · Cited by 55
Particle Swarm for the Traveling Salesman Problem
Goldbarg, E. F. G., de Souza, G. R., & Goldbarg, M. C. (2006) · Lecture notes in computer science · doi:10.1007/11730095_9 · Cited by 44
Discrete Multi-Phase Particle Swarm Optimization
Al-kazemi, B., & Mohan, C. K. (2005) · Springer eBooks · doi:10.1007/1-84628-117-2_20 · Cited by 24
Cited by
Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review
Bonyadi, M. R., & Michalewicz, Z. (2017) · Evolutionary Computation · doi:10.1162/evco_r_00180 · Cited by 841
Sengupta, S., Basak, S., & Peters, R. (2018) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010010 · Cited by 543
Major Advances in Particle Swarm Optimization: Theory, Analysis, and Application
Houssein, E. H., Gad, A. G., Hussain, K., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100868 · Cited by 466
RetractedGong, M., Cai, Q., Chen, X., & Ma, L. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2260862 · Cited by 394
Zhan, Z.-H., Li, J., Cao, J., Zhang, J., Chung, H. S.-H., & Shi, Y.-H. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2209115 · Cited by 346
Self-citation
Metadata
- Authors
- Chen, W.-N., Zhang, J., Chung, H. S. H., Zhong, W.-L., Wu, W.-G., & Shi, Y.-H.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2010-04
- Volume
- 14
- Issue
- 2
- Pages
- 278-300
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2120204384
- Cited by
- 423
- References
- 44
- FWCI
- 18.79
- 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.