2017
DOI: 10.1155/2017/3235720
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search

Abstract: Binary bat algorithm (BBA) is a binary version of the bat algorithm (BA). It has been proven that BBA is competitive compared to other binary heuristic algorithms. Since the update processes of velocity in the algorithm are consistent with BA, in some cases, this algorithm also faces the premature convergence problem. This paper proposes an improved binary bat algorithm (IBBA) to solve this problem. To evaluate the performance of IBBA, standard benchmark functions and zero-one knapsack problems have been emplo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 28 publications
0
11
0
Order By: Relevance
“…The bat algorithm (BA) was first presented in [22]. BA has also been successfully applied and used in many fields especially as optimization problem [24,25,26], clustering problem [27,28] and many other problems [29,30,31,32].…”
Section: Bat Algorithmmentioning
confidence: 99%
“…The bat algorithm (BA) was first presented in [22]. BA has also been successfully applied and used in many fields especially as optimization problem [24,25,26], clustering problem [27,28] and many other problems [29,30,31,32].…”
Section: Bat Algorithmmentioning
confidence: 99%
“…It can be assumed that all weights and profits are nonnegative, and that all weights are not larger than the limited capacity C. Twelve test cases with different scales are considered to verify the optimization performance of A-AMBA for the knapsack problems. The typical test cases k 1 -k 5 [25], [26] are recorded as Table 9, where 'D' represents the dimension of knapsack problems, 'Parameters(w, p, C)' indicates the information of weight, profit and weight capacity, and 'Opt' presents the optimal value of corresponding knapsack problem. The cases k 6 -k 12 with large scales are designed to testify and compare the performance of the four comparative algorithms, using a random number generator.…”
Section: Zero-one Knapsack Problemmentioning
confidence: 99%
“…K-means is considered as the familiar algorithms for performing the cluster and it is a conventional distance based method and the distance is the measure of the similarity which define the short distance that tend to high similarity to Show all objects. Select K from the given N as the number of initial cluster center [27]. Measure the distance among each object and cluster center "m".…”
Section: Seed Selection Using Improved K-means Clustering Algorithm Wmentioning
confidence: 99%
“…They will reduce the loudness and increase the frequency of emitted ultrasonic sound, when bats chase preys. These characteristics of real bats help in establishing the BA [27]. These basic steps of BA have been mathematically described as follows.…”
Section: Seed Selection Using Improved K-means Clustering Algorithm Wmentioning
confidence: 99%