2021
DOI: 10.1109/tcyb.2019.2944141
|View full text |Cite
|
Sign up to set email alerts
|

A New Binary Particle Swarm Optimization Approach: Momentum and Dynamic Balance Between Exploration and Exploitation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
32
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 85 publications
(32 citation statements)
references
References 43 publications
0
32
0
Order By: Relevance
“…According to [19], the inertia weight value plays an important role in balancing exploration and exploration in search space. The linear time-varying inertia weight is applied in this study as shown in ( 7), its value decreases from 0.9 to 0.4 according to the number of iteration [33].…”
Section: Features From Frequency Domainmentioning
confidence: 99%
See 1 more Smart Citation
“…According to [19], the inertia weight value plays an important role in balancing exploration and exploration in search space. The linear time-varying inertia weight is applied in this study as shown in ( 7), its value decreases from 0.9 to 0.4 according to the number of iteration [33].…”
Section: Features From Frequency Domainmentioning
confidence: 99%
“…It is converted into the binary value for the corresponding position by the transfer function. In the binary search space, new solutions are created by flipping their position entries [19]. Therefore, there is no guarantee that the new positions after going through the update process do not coincide with the previous ones.…”
Section: Introductionmentioning
confidence: 99%
“…The continuous search step uses the conventional PSO method, and the binary search step is implemented as the primary search strategy and uses a "stickiness" momentum mechanism in BPSO. The term "stickiness" was proposed by Nguyen et al [55,57]. Since applying the speed concept of PSO directly to BPSO is not appropriate, the main idea of "stickiness" is that a particle moves by flipping its position entry in BPSO.…”
Section: Mixed Pso Algorithmmentioning
confidence: 99%
“…Particle swarm optimization (PSO) is an evolutionary computation technology [ 12 ], which is derived from the research on the behavior of bird predation—a random search algorithm based on group collaboration developed by simulating the behavior of bird foraging. PSO can deal with some problems that cannot be dealt with by traditional methods, such as the lack of gradient information, but its performance is flawed, so someone proposed the binary PSO (BPSO) [ 13 ]. In the BPSO algorithm, each dimension of each particle is taken as a binary discrete value, namely, 0 or 1, and there is no limit to speed.…”
Section: Introductionmentioning
confidence: 99%