The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Adaptive Multiobjective Particle Swarm Optimization Based on Parallel Cell Coordinate System
Abstract
Managing convergence and diversity is essential in the design of multiobjective particle swarm optimization (MOPSO) in search of an accurate and well distributed approximation of the true Pareto-optimal front. Largely due to its fast convergence, particle swarm optimization incurs a rapid loss of diversity during the evolutionary process. Many mechanisms have been proposed in existing MOPSOs in terms of leader selection, archive maintenance, and perturbation to tackle this deficiency. However, few MOPSOs are designed to dynamically adjust the balance in exploration and exploitation according to the feedback information detected from the evolutionary environment. In this paper, a novel method, named parallel cell coordinate system (PCCS), is proposed to assess the evolutionary environment including density, rank, and diversity indicators based on the measurements of parallel cell distance, potential, and distribution entropy, respectively. Based on PCCS, strategies proposed for selecting global best and personal best, maintaining archive, adjusting flight parameters, and perturbing stagnation are integrated into a self-adaptive MOPSO (pccsAMOPSO). The comparative experimental results show that the proposed pccsAMOPSO outperforms the other eight state-of-the-art competitors on ZDT and DTLZ test suites in terms of the chosen performance metrics. An additional experiment for density estimation in MOPSO illustrates that the performance of PCCS is superior to that of adaptive grid and crowding distance in terms of convergence and diversity.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
Principles and Procedures of Statistics: A Biometrical Approach
Steel, R. G. D., & Torrie, J. H. (1980) · Andalas University Repository (Andalas University) · Cited by 15,510
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
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
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
The 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
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
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
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
Principles and Procedures of Statistics: A Biometrical Approach.
Booth, G. D., Steel, R. G. D., & Torrie, J. H. (1981) · Journal of the American Statistical Association · doi:10.2307/2287561 · Cited by 2,557
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
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
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
Scalable multi-objective optimization test problems
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1007032 · Cited by 1,627
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
Laumanns, M., Thiele, L., Deb, K., & Zitzler, E. (2002) · Evolutionary Computation · doi:10.1162/106365602760234108 · Cited by 1,487
The plane with parallel coordinates
Inselberg, A. (1985) · The Visual Computer · doi:10.1007/bf01898350 · Cited by 1,423
An analysis of particle swarm optimizers
van den Bergh, F., & Engelbrecht, A. P. (2002) · UpSpace Institutional Repository (University of Pretoria) · Cited by 1,411
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
Multiobjective optimization using evolutionary algorithms
Sbalzarini, I. F., Mullery, S., & Koumoutsakosyz, P. (2000) · Cited by 920
An Investigation of Niche and Species Formation in Genetic Function Optimization
Deb, K., & Goldberg, D. E. (1989) · international conference on Genetic algorithms · Cited by 828
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
Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO)
Mostaghim, S., & Teich, J. (2004) · IEEE Swarm Intelligence Symposium · doi:10.1109/sis.2003.1202243 · Cited by 654
An effective use of crowding distance in multiobjective particle swarm optimization
Raquel, C. R., & Naval, P. C. (2005) · Proceedings of the 7th annual conference on Genetic and evolutionary computation · doi:10.1145/1068009.1068047 · Cited by 623
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
A Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization
Li, X. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-45105-6_4 · Cited by 532
Adaptive particle swarm optimization: detection and response to dynamic systems
Hu, X., & Eberhart, R. C. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004492 · Cited by 335
An Investigation on Preference Order Ranking Scheme for Multiobjective Evolutionary Optimization
di Pierro, F., Khu, S.-T., & Savi, D. A. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.876362 · Cited by 280
Dissipative particle swarm optimization
Xie, X.-F., Zhang, W.-J., & Yang, Z.-L. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004457 · Cited by 269
Finding Acceptable Solutions in the Pareto-Optimal Range using Multiobjective Genetic Algorithms
Bentley, P. J., & Wakefield, J. P. (1998) · Soft Computing in Engineering Design and Manufacturing · doi:10.1007/978-1-4471-0427-8_25 · Cited by 248
A multi-objective particle swarm optimizer based on decomposition
Zapotecas Martínez, S., & Coello Coello, C. A. (2011) · Proceedings of the 13th annual conference on Genetic and evolutionary computation · doi:10.1145/2001576.2001587 · Cited by 246
Performance Metric Ensemble for Multiobjective Evolutionary Algorithms
Yen, G. G., & He, Z. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2240687 · Cited by 207
Self-citationDynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation
Yen, G. G., & Lu, H. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810068 · Cited by 201
Self-citationPSO-Based Multiobjective Optimization With Dynamic Population Size and Adaptive Local Archives
Leong, W.-F., & Yen, G. G. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.925757 · Cited by 185
Self-citationRank-density-based multiobjective genetic algorithm and benchmark test function study
Lu, H., & Yen, G. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.812220 · Cited by 177
Self-citationRanking Methods for Many-Objective Optimization
Garza-Fabre, M., Toscano‐Pulido, G., & Coello, C. A. C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-05258-3_56 · Cited by 126
Li, X. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24854-5_11 · Cited by 112
Cultural-Based Multiobjective Particle Swarm Optimization
Daneshyari, M., & Yen, G. G. (2010) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2010.2068046 · Cited by 107
Self-citationPeng, W., & Zhang, Q. (2008) · IEEE International Conference on Granular Computing (GrC) · doi:10.1109/grc.2008.4664724 · Cited by 88
Empirical comparison of MOPSO methods - Guide selection and diversity preservation -
Padhye, N., Branke, J., & Mostaghim, S. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4983257 · Cited by 70
Intelligent particle swarm optimization in multiobjective optimization
Zhang, X., Hong-yun, M., & Li-cheng, J. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2005.1554753 · Cited by 40
Comparison of archiving methods in multi-objectiveparticle swarm optimization (MOPSO)
Padhye, N. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570143 · Cited by 30
Kadkol, A. A., & Yen, G. G. (2012) · International Journal of Swarm Intelligence Research · doi:10.4018/jsir.2012010101 · Cited by 6
Self-citationCultural-based particle swarm for dynamic optimisation problems
Daneshyari, M., & Yen, G. G. (2011) · International Journal of Systems Science · doi:10.1080/00207721.2011.605965 · Cited by 6
Self-citation
Cited by
Efficient Large-Scale Multiobjective Optimization Based on a Competitive Swarm Optimizer
Tian, Y., Zheng, X., Zhang, X., & Jin, Y. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2906383 · Cited by 480
A competitive mechanism based multi-objective particle swarm optimizer with fast convergence
Zhang, X., Zheng, X., Cheng, R., Qiu, J., & Jin, Y. (2018) · Information Sciences · doi:10.1016/j.ins.2017.10.037 · Cited by 425
Particle swarm optimization of deep neural networks architectures for image classification
Fernandes Junior, F. E., & Yen, G. G. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.05.010 · Cited by 393
Self-citationLin, Q., Liu, S., Zhu, Q., Tang, C., Song, R., Chen, J., Coello, C. A. C., Wong, K.-C., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2631279 · Cited by 309
Improving Metaheuristic Algorithms With Information Feedback Models
Wang, G.-G., & Tan, Y. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2780274 · Cited by 285
Metadata
- Authors
- Hu, W., & Yen, G. G.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2015-02
- Volume
- 19
- Issue
- 1
- Pages
- 1-18
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2079934979
- Cited by
- 273
- References
- 47
- FWCI
- 22.78
- 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.