IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem

An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem
View Sample PDF
Author(s): Sulabh Bansal (School of Computing and Information Technology, Manipal University Jaipur, Jaipur, India)and C. Patvardhan (Faculty of Engineering, Dayalbagh Educational Institute (DEI), Agra, India)
Copyright: 2021
Pages: 29
Source title: Research Anthology on Advancements in Quantum Technology
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-7998-8593-1.ch002

Purchase

View An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem on the publisher's website for pricing and purchasing information.

Abstract

This article describes how the 0/1 Multiple Knapsack Problem (MKP), a generalization of popular 0/1 Knapsack Problem, is NP-hard and harder than simple Knapsack Problem. Solution of MKP involves two levels of choice – one for selecting an item to be placed and the other for selecting the knapsack in which it is to be placed. Quantum Inspired Evolutionary Algorithms (QIEAs), a subclass of Evolutionary algorithms, have been shown to be effective in solving difficult problems particularly NP-hard combinatorial optimization problems. QIEAs provide a general framework which needs to be customized according to the requirements of a given problem to obtain good solutions in reasonable time. An existing QIEA for MKP (QIEA-MKP) is based on the representation where a Q-bit collapse into a binary number. But decimal numbers are required to identify the knapsack where an item is placed. The implementation based on such representation suffers from overhead of frequent conversion from binary numbers to decimal numbers and vice versa. The generalized QIEA (GQIEA) is based on a representation where a Q-bit can collapse into an integer and thus no inter conversion between binary and decimal is required. A set of carefully selected features have been incorporated in proposed GQIEA-MKP to obtain better solutions in lesser time. Comparison with QIEA-MKP shows that GQIEA-MKP outperforms it in providing better solutions in lesser time for large sized MKPs. The generalization proposed can be used with advantage in other Combinatorial Optimization problems with integer strings as solutions.

Related Content

M. Suchetha, Jaya Sai Kotamsetti, Dasapalli Sasidhar Reddy, S. Preethi, D. Edwin Dhas. © 2024. 14 pages.
A. Bhuvaneswari, R. Srivel, N. Elamathi, S. Shitharth, K. Sangeetha. © 2024. 15 pages.
Srinivas Kumar Palvadi. © 2024. 28 pages.
Srinivas Kumar Palvadi. © 2024. 20 pages.
Nitika Kapoor, Parminder Singh, Kusrini M. Kom, Vishal Bharti. © 2024. 19 pages.
M. Suchetha, V. V. Rama Raghavan, Shaik Fardeen, P. V. S. Nithish, S. Preethi, D. Edwin Dhas. © 2024. 13 pages.
Damandeep Kaur, Shamandeep Singh, Simarjeet Kaur, Gurpreet Singh, Rani Kumari. © 2024. 17 pages.
Body Bottom