2020
DOI: 10.1109/access.2020.3007846
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Multi-Objective Particle Swarm Optimization Algorithm Based on a New Archive Updating Mechanism

Abstract: Multi-objective optimization has received increasing attention over the past few decades,and a large number of nature-inspired metaheuristic algorithms have been developed to solve multi-objective problems. An external archive is often used to store elite solutions in multi-objective algorithms. Since the archive size is limited, it must be truncated when the number of nondominated solutions exceeds its maximum size. Thus, the archive updating strategy is crucial due to its influence in the performance of the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(6 citation statements)
references
References 44 publications
(55 reference statements)
0
6
0
Order By: Relevance
“…In [18], Chen et al used the decomposition idea to transform MOPs into a single-objective optimization problem and proposed a new speed update mechanism. In addition to the MOPSO mentioned above based on crowding distance and decomposition, many representative MOPSOs have appeared in recent years, such as GMRMOPSO [2], MOPSO-ASFS [23], AMPSO/ESE [24], MOPSONN [25], and others. In particular, in MOPSONN, the author proposed an archive updating mechanism based on the nearest neighbor method using the competition mechanism.…”
Section: Related Workmentioning
confidence: 99%
“…In [18], Chen et al used the decomposition idea to transform MOPs into a single-objective optimization problem and proposed a new speed update mechanism. In addition to the MOPSO mentioned above based on crowding distance and decomposition, many representative MOPSOs have appeared in recent years, such as GMRMOPSO [2], MOPSO-ASFS [23], AMPSO/ESE [24], MOPSONN [25], and others. In particular, in MOPSONN, the author proposed an archive updating mechanism based on the nearest neighbor method using the competition mechanism.…”
Section: Related Workmentioning
confidence: 99%
“…MOAFSA. According to the ideas of multiobjective evolutionary algorithm and multiobjective particle swarm algorithm [23][24][25][26][27], to improve the basic artificial fish swarm algorithm to multiobjective artificial fish swarm algorithm, the following three issues need to be addressed. ( 1) Fast searching Pareto optimal solutions and constructing Pareto optimal solution set; (2) determining the moving direction of artificial fish under multiobjective conditions; and (3) maintaining and updating the bulletin board (external archives) of artificial fish swarm.…”
Section: Multiobjective Artificial Fish Swarm Algorithmmentioning
confidence: 99%
“…where the range of x 1 and x 2 are from −4 to 4 in Equations ( 9) and ( 10). The range of x 1 , x 2 , and x 3 are from 0 to 1 in Equations ( 11) and (12). The SKMOO shows superior performance than existing algorithms.…”
Section: Verification Of Proposed Algorithmmentioning
confidence: 99%