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

DOI10.1016/j.cam.2013.04.004zbMath1288.68073OpenAlexW2060348801MaRDI QIDQ2453178

Abdesslem Layeb

Publication date: 6 June 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.04.004

zbMATH Keywords

hybrid algorithmsquantum computingknapsack problemsharmony search algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

Comparison of different metaheuristic algorithms based on intercriteria analysis ⋮ Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems ⋮ Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm ⋮ Control of set of system parameter values by the ant colony method ⋮ Putting continuous metaheuristics to work in binary search spaces ⋮ Improved biogeography-based optimization with random ring topology and Powell's method

Uses Software

• ABC

Cites Work

• Solving the sum-of-ratios problems by a harmony search algorithm
• A self-adaptive global best harmony search algorithm for continuous optimization problems
• Hybridizing exact methods and metaheuristics: a taxonomy
• A genetic algorithm for the multidimensional knapsack problem
• Where are the hard knapsack problems?
• Improved results on the 0--1 multidimensional knapsack problem
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Firefly Algorithms for Multimodal Optimization
• Theory of genetic algorithms

This page was built for publication: A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems