2012
DOI: 10.1007/s00521-012-1028-9
|View full text |Cite
|
Sign up to set email alerts
|

Bat algorithm for constrained optimization tasks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
176
0
3

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 475 publications
(181 citation statements)
references
References 61 publications
2
176
0
3
Order By: Relevance
“…Furthermore, the survival process of bats is achieved based on the injective (one-to-one) strategy, where the fit one replaces the worst one based on feasibility rule. The performance of Convergence behavior for LKP 21 Convergence behavior for LKP 22 Convergence behavior for LKP 23 Convergence behavior for LKP 24 Convergence behavior for LKP 25 Convergence behavior for LKP 26 Convergence behavior for LKP 26 Convergence behavior for LKP 27 Convergence behavior for LKP 28 Convergence behavior for LKP 29 Convergence behavior for LKP 30 Convergence behavior for LKP 31 Table 9 Wilcoxon test for comparison results in Tables 5 and 6 Compared methods Solution evaluations…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Furthermore, the survival process of bats is achieved based on the injective (one-to-one) strategy, where the fit one replaces the worst one based on feasibility rule. The performance of Convergence behavior for LKP 21 Convergence behavior for LKP 22 Convergence behavior for LKP 23 Convergence behavior for LKP 24 Convergence behavior for LKP 25 Convergence behavior for LKP 26 Convergence behavior for LKP 26 Convergence behavior for LKP 27 Convergence behavior for LKP 28 Convergence behavior for LKP 29 Convergence behavior for LKP 30 Convergence behavior for LKP 31 Table 9 Wilcoxon test for comparison results in Tables 5 and 6 Compared methods Solution evaluations…”
Section: Discussionmentioning
confidence: 99%
“…The sizes of these instances include 100, 200, 300, 500, 700, 1000, 1200, 1500, 1800, 2000, 2600 and 3000 items. Each large-scale KP (KP 11 -KP 22 ) is generated as follows: the volume of each item is randomly chosen from 0.5 and 2 and its corresponding profit is randomly set between 0.5 and 1. The maximal volume capacity of the knapsack is limited to 0.75 times of the sum volumes of the items generated following the above procedure.…”
Section: Large-scale 0-1 Knapsack Problemsmentioning
confidence: 99%
See 1 more Smart Citation
“…One such algorithm is Bat algorithm which has diverse applications [33]. In [6] a simple Bat algorithm was used to solve constrained based optimization problem. A novel hybrid algorithm was designed for global numerical optimization by using Bat algorithm and Harmonic Search (HS) [27] .…”
Section: Motivation and Related Workmentioning
confidence: 99%
“…Nowadays, the group of algorithms that belong within the category of swarm intelligence is very extensive. Among the latest nature-inspired metaheuristics are the Bat Algorithm [8] the Harmony Search [16], the Firefly Algorithm [7,23], the Cuckoo Search [6,27], the Flower Pollination Algorithm [22] and the Krill Herd Algorithm [4].…”
Section: Introductionmentioning
confidence: 99%