2016
DOI: 10.1007/s00500-016-2383-8
|View full text |Cite
|
Sign up to set email alerts
|

CS-PSO: chaotic particle swarm optimization algorithm for solving combinatorial optimization problems

Abstract: Combinatorial optimization problems are typically NP-hard, due to their intrinsic complexity. In this paper, we propose a novel chaotic particle swarm optimization algorithm (CS-PSO), which combines the chaos search method with the particle swarm optimization algorithm (PSO) for solving combinatorial optimization problems. In particular, in the initialization phase, the priori knowledge of the combination optimization problem is used to optimize the initial particles. According to the properties of the combina… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 79 publications
(27 citation statements)
references
References 21 publications
(19 reference statements)
0
22
0
Order By: Relevance
“…At present, some scholars have applied it to the optimization of neural network weights and achieved good results. Based on the three inherent properties of the chaos, including stochastic property, ergodicity, and regularity [39], the new superior individuals are reproduced by chaotic searching on the current global best individuals. For the regularity and ergodicity property, the chaos searching can traverse all states without repeating within a certain range.…”
Section: Offline Tuning Based On the Cpsomentioning
confidence: 99%
“…At present, some scholars have applied it to the optimization of neural network weights and achieved good results. Based on the three inherent properties of the chaos, including stochastic property, ergodicity, and regularity [39], the new superior individuals are reproduced by chaotic searching on the current global best individuals. For the regularity and ergodicity property, the chaos searching can traverse all states without repeating within a certain range.…”
Section: Offline Tuning Based On the Cpsomentioning
confidence: 99%
“…In this section, we compare the PS-CTPSO algorithm, the GB-PSO algorithm (proposed in [19]), and the improved PS-CSPSO algorithm (based on CS-PSO [25]) on the same Web Service datasets. More specifically, the order of magnitudes of dataset was defined as 30, 90, 180, 450 and 1350, respectively.…”
Section: Experimental Data and Performance Indicatorsmentioning
confidence: 99%
“…The particle swarm optimization (PSO) has the limitation of prematurely convergence and it doesn't explore the available search space due to more dependency on the local best positions of swarms. Previously researchers had improved the PSO global nature by introducing chaotic mapping in the current position in every iteration [24]] [25][26] [27]. They also focused on updating the values of random constants 1 , 2 chaotically.…”
Section: Proposed Optimization Solutionmentioning
confidence: 99%
“…We propose a novel hole healing approach based on the hybrid Chaotic PSO GSA optimization algorithm. The papers form [24][25][26][27] reflected the Chaotic PSO used for different applications. In [24] the overall convergence improved by update the value of r1 and r2 in PSO chaotically.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation