2017
DOI: 10.1007/s11047-016-9609-7
|View full text |Cite
|
Sign up to set email alerts
|

Solving the non-unicost set covering problem by using cuckoo search and black hole optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 28 publications
(21 citation statements)
references
References 40 publications
0
21
0
Order By: Relevance
“…As future works, we believe that using new approximate optimization algorithms will allow us to find better results to compare the SVM classifier performance. Moreover, we intend to incorporate an autonomous version of these algorithms so that the self-adaptive of its parameters is not complex and suited to the instance of the problem, as described in [ 9 , 11 ].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…As future works, we believe that using new approximate optimization algorithms will allow us to find better results to compare the SVM classifier performance. Moreover, we intend to incorporate an autonomous version of these algorithms so that the self-adaptive of its parameters is not complex and suited to the instance of the problem, as described in [ 9 , 11 ].…”
Section: Discussionmentioning
confidence: 99%
“…On the other hand, recently, several approaches have emerged, inspired by natural phenomena, that allow solving complex optimization and combinatorial problems in reduced time periods [ 9 12 ]. These techniques have been successful when the complexity of the problem is not linear, given that they do not explore the solution tree in their completeness.…”
Section: Introductionmentioning
confidence: 99%
“…Black hole algorithm belongs to the swarm intelligence algorithm, which are inspired either by living bodies, like ants [88], bees [89], fishes [90], bats [91], krill herds [92], fireflies [93], fruit flies [94], bacteria's [95], or by other natural phenomena, like gravitation [96], big-bang [97], or intelligent water drop [98]. Black hole optimization is used in a wide range of NP-hard optimization problems, like investigating the critical slip surface of soil slope [99], solving the non-unicost set covering problem [100], optimization of consignment-store-based supply chain [101], thermodynamic optimization of a Penrose process [102], power flow optimization [103], and design of electromagnetic devices [104], but one of its most important application fields is the clustering. The black hole algorithms have six phases as follows:…”
Section: Black Hole Optimization-based Clusteringmentioning
confidence: 99%
“…BHO can be combined with other heuristic algorithms to improve its efficiency and convergence. The integration of the core of swarming optimization methods can increase the efficiency of preprocessing, transfer functions, and the discretization [47].…”
Section: Literature Reviewmentioning
confidence: 99%