Work

Balanced Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem

Year: 2014
Type: article
Abstract: 1 M ultiple Knapsack Problem, a generalization of more popular 0/1 Knapsack Problem, is NP-hard and considered harder than simple Knapsack Problem.0/1 M ultiple Knapsack Problem has many applications in disciplines related to computer science and operations research.Quantum Inspired Evolutionary Algorithms (QIEAs), a subclass of Evolutionary algorithms, are considered effective to solve difficult problems particularly NP-hard combinatorial optimization problems.A hybrid QIEA is presented for multiple knapsack problem which incorporates several features for better balance between exploration and exploitation.The proposed QIEA, dubbed QIEA-M KP, provides significantly improved performance over simple QIEA from both the perspectives viz., the quality of solutions and computational effort required to reach the best solution.QIEA-M KP is also able to provide the solutions that are better than those obtained using a well known heuristic alone.
Language: English
Open Access status: bronze
OpenAlex ID: W2145407993
FWCI: 0.438
Cites: 41
Cited by: 5
Related to: 10