2018
DOI: 10.1007/978-3-030-05481-6_8
|View full text |Cite
|
Sign up to set email alerts
|

A Chaotic Binary Salp Swarm Algorithm for Solving the Graph Coloring Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0
1

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 22 publications
(5 citation statements)
references
References 31 publications
0
4
0
1
Order By: Relevance
“…Chuôĩ này đươ ̣c chia thành hai nhóm: lãnh đạo và như ñg con theo dõi. Con lãnh đạo ơ ̉vị trí dâñ đâù chuôĩ, phâǹ còn lại của Salps là như ñg con theo sau [39][40][41].…”
Section: Thuật Toán Bâỳ Salps (Ssa)unclassified
“…Chuôĩ này đươ ̣c chia thành hai nhóm: lãnh đạo và như ñg con theo dõi. Con lãnh đạo ơ ̉vị trí dâñ đâù chuôĩ, phâǹ còn lại của Salps là như ñg con theo sau [39][40][41].…”
Section: Thuật Toán Bâỳ Salps (Ssa)unclassified
“…The scenario is depicted in Figure 2. "The salp at the top of the chain is known as the leader, while the others are known as followers":As the name of these salps indicates, the leading directors swarm and thus the followers following each other (Achelia, 2018). Salps' dynamic motions boost the SSA's searching capabilities, allowing it to avoid global optimization problems and immature convergence limitations.…”
Section: Salp Swarm Algorithmmentioning
confidence: 99%
“…Ibrahim et al proposed a hybrid optimization method for the feature selection problem which combines the slap swarm algorithm with the particle swarm optimization (SSAPSO) [98]. The chaotic binary salp swarm algorithm (CBSSA) [99] was introduced by Meraihi et al to solve the graph coloring problem. The CBSSA applies a logistic map to replace the random variables used in the SSA, which causes it to avoid the stagnation to local optima and improves exploration and exploitation.…”
Section: Related Workmentioning
confidence: 99%