The DOI matches its Crossref record; 62 of the 62 references it cites were found in a registry or an index.
Multiple Populations for Multiple Objectives: A Coevolutionary Technique for Solving Multiobjective Optimization Problems
Abstract
Traditional multiobjective evolutionary algorithms (MOEAs) consider multiple objectives as a whole when solving multiobjective optimization problems (MOPs). However, this consideration may cause difficulty to assign fitness to individuals because different objectives often conflict with each other. In order to avoid this difficulty, this paper proposes a novel coevolutionary technique named multiple populations for multiple objectives (MPMO) when developing MOEAs. The novelty of MPMO is that it provides a simple and straightforward way to solve MOPs by letting each population correspond with only one objective. This way, the fitness assignment problem can be addressed because the individuals' fitness in each population can be assigned by the corresponding objective. MPMO is a general technique that each population can use existing optimization algorithms. In this paper, particle swarm optimization (PSO) is adopted for each population, and coevolutionary multiswarm PSO (CMPSO) is developed based on the MPMO technique. Furthermore, CMPSO is novel and effective by using an external shared archive for different populations to exchange search information and by using two novel designs to enhance the performance. One design is to modify the velocity update equation to use the search information found by different populations to approximate the whole Pareto front (PF) fast. The other design is to use an elitist learning strategy for the archive update to bring in diversity to avoid local PFs. CMPSO is comprehensively tested on different sets of benchmark problems with different characteristics and is compared with some state-of-the-art algorithms. The results show that CMPSO has superior performance in solving these different sets of MOPs.
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
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
Zadeh, L. A. (1996) · Cited by 46,852
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
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-citationMOEA/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
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
Fuzzy Sets and Systems - Theory and Applications
(1980) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(09)x6008-x · Cited by 6,383
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
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
Cited by
Cloud Computing Resource Scheduling and a Survey of Its Evolutionary Approaches
Zhan, Z.-H., Liu, X.-F., Gong, Y.-J., Zhang, J., Chung, H. S.-H., & Li, Y. (2015) · ACM Computing Surveys · doi:10.1145/2788397 · Cited by 482
Self-citationTest Problems for Large-Scale Multiobjective and Many-Objective Optimization
Cheng, R., Jin, Y., Olhofer, M., & sendhoff, B. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2600577 · Cited by 427
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
A survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
Self-citationAn Energy Efficient Ant Colony System for Virtual Machine Placement in Cloud Computing
Liu, X.-F., Zhan, Z.-H., Deng, J. D., Li, Y., Gu, T., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2623803 · Cited by 407
Self-citationA Multiobjective Evolutionary Algorithm Using Gaussian Process-Based Inverse Modeling
Cheng, R., Jin, Y., Narukawa, K., & Sendhoff, B. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2395073 · Cited by 377
A Novel Sigmoid-Function-Based Adaptive Weighted Particle Swarm Optimizer
Liu, W., Wang, Z., Yuan, Y., Zeng, N., Hone, K., & Liu, X. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2925015 · Cited by 346
Lin, 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
Self-citationA novel multi-objective particle swarm optimization with multiple search strategies
Lin, Q., Li, J., Du, Z., Chen, J., & Ming, Z. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.06.071 · Cited by 300
Self-citationRecent Development in Big Data Analytics for Business Operations and Risk Management
Choi, T.-M., Chan, H. K., & Yue, X. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2507599 · Cited by 278
Multiobjective Cloud Workflow Scheduling: A Multiple Populations Ant Colony System Approach
Chen, Z.-G., Zhan, Z.-H., Lin, Y., Gong, Y.-J., Gu, T.-L., Zhao, F., Yuan, H.-Q., Chen, X., Li, Q., & Zhang, J. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2832640 · Cited by 278
Self-citationAdaptive Replacement Strategies for MOEA/D
Wang, Z., Zhang, Q., Zhou, A., Gong, M., & Jiao, L. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2403849 · Cited by 257
Metadata
- Authors
- Zhan, Z.-H., Li, J., Cao, J., Zhang, J., Chung, H. S.-H., & Shi, Y.-H.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2013-04
- Volume
- 43
- Issue
- 2
- Pages
- 445-463
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2156262512
- Cited by
- 346
- References
- 62
- FWCI
- 20.70
- 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.