Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem
by C. Patvardhan; V. Prem Prakash; A. Srivastav
International Journal of Mathematics in Operational Research (IJMOR), Vol. 4, No. 2, 2012

Abstract: The Knapsack Problem assigns weights and values to each of a given set of objects, with the objective of choosing a subset no larger than some specified weight constraint in such a manner as to maximise the total value accrued thereby. The Quadratic Kapsack Problem (QKP) extends KP by associating values with not just individual objects but also with pairs of objects. The problem is known to be NP-hard and arises in several domains including finance, VLSI design and location problems. Greedy heuristics and Genetic Algorithms (GAs) for QKP exist in the literature. Quantum-inspired Evolutionary Algorithms (QEAs) are population-based probabilistic EAs that integrate concepts from quantum computing for higher representational power and robust search. This paper presents novel Quantum-inspired Evolutionary Algorithms (QEAs) that integrate concepts from quantum computing for higher representational power and robust search. The performance of the QEAs is shown to be competitive vis-à-vis two recent well known GAs over a wide range of benchmark instances.

Online publication date: Tue, 23-Dec-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com