Welcome to the InfoSci Platform
Reference Hub2
Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm

Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm

C. Patvardhan, Sulabh Bansal, Anand Srivastav
Copyright: © 2014 |Volume: 5 |Issue: 1 |Pages: 17
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781466652392|DOI: 10.4018/ijaec.2014010104
Cite Article Cite Article

MLA

Patvardhan, C., et al. "Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm." IJAEC vol.5, no.1 2014: pp.52-68. http://doi.org/10.4018/ijaec.2014010104

APA

Patvardhan, C., Bansal, S., & Srivastav, A. (2014). Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm. International Journal of Applied Evolutionary Computation (IJAEC), 5(1), 52-68. http://doi.org/10.4018/ijaec.2014010104

Chicago

Patvardhan, C., Sulabh Bansal, and Anand Srivastav. "Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm," International Journal of Applied Evolutionary Computation (IJAEC) 5, no.1: 52-68. http://doi.org/10.4018/ijaec.2014010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Knapsack Problem (KP) is a popular combinatorial optimization problem having application in many technical and economic areas. Several attempts have been made in past to solve the problem. Various exact and non-exact approaches exist to solve KP. Exact algorithms for KP are based on either branch and bound or dynamic programming technique. Heuristics exist which solve KP non-exactly in lesser time. Heuristic approaches do not provide any guarantee regarding the quality of solution whereas exact approaches have high worst case complexities. Quantum-inspired Evolutionary Algorithm (QEA) is a subclass of Evolutionary Algorithm, a naturally inspired population based search technique. QEA uses concepts of quantum computing. An engineered Quantum-inspired Evolutionary Algorithm (QEA-E), an improved version of QEA, is presented which quickly solves extremely large spanner problem instances (e.g. 290,000 items) that are very difficult for the state of the art exact algorithm as well as the original QEA.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.