2013
DOI: 10.1016/j.cam.2013.04.004
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
38
0
1

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 96 publications
(39 citation statements)
references
References 17 publications
0
38
0
1
Order By: Relevance
“…An application to image thresholding using quantum ant colony optimization is reported in [55]. Two quantum binarization applications to the knapsack problem are reported previously using harmony search in [58] and monkey algorithm in [59]. The quantum differential evolution algorithm was applied to the knapsack problem in [53], combinatorial problems [54], and image threshold methods in [55].…”
Section: Binarization Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…An application to image thresholding using quantum ant colony optimization is reported in [55]. Two quantum binarization applications to the knapsack problem are reported previously using harmony search in [58] and monkey algorithm in [59]. The quantum differential evolution algorithm was applied to the knapsack problem in [53], combinatorial problems [54], and image threshold methods in [55].…”
Section: Binarization Methodsmentioning
confidence: 99%
“…A 4 Complexity quantum ant colony optimization was applied to image threshold in [55]. Using Harmony Search in [58] and Monkey algorithm in [59], quantum binarizations were applied to the knapsack problem. The unsupervised learning K-means clustering method is used to perform binarization in different problems as is shown in Figure 1.…”
Section: Binarization Methodsmentioning
confidence: 99%
“…In order to evaluate the performance of the proposed TDDE algorithm for solving 0-1 knapsack problems, twenty 0-1 knapsack test instances are produced by using the method as recommended by [4], which is widely used in the field of 0-1 knapsack problem research [15,16,19]. To generate each 0-1 knapsack test instance, we randomly generate the weight W j and profit P j for item j, where j = 1, · · · , D; W j is a uniformly distributed random number in the range [5,20], P j is randomly generated from a uniform distribution in the range [50,100] and the maximum weight capacity of a knapsack C is set to:…”
Section: Methodsmentioning
confidence: 99%
“…Quantum theory is an ongoing research in the fields of quick search [20], optimization [21,22], clustering [23], and key distribution [24]. The work of incorporating quantum mechanics into other theories has stimulated the researches of quantum-inspired algorithms and their applications.…”
Section: Introductionmentioning
confidence: 99%