Abstract
The quadratic multiple knapsack problem is an extension of the well known 0/1 multiple knapsack problem. In the quadratic multiple knapsack problem, profit values are associated not only with individual objects but also with pairs of objects. Profit value associated with a pair of objects is added to the overall profit if both objects of the pair belong to the same knapsack. Being an extension of the 0/1 multiple knapsack problem, this problem is also NP-Hard. In this paper, we have proposed a new steady-state grouping genetic algorithm for the quadratic multiple knapsack problem and compared our results with two recently proposed methods – a genetic algorithm and a stochastic hill climber. The results show the effectiveness of our approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
Khuri, S., Bäck, T., Heitkötter, J.: The Zero/One Multiple Knapsack Problem and Genetic Algorithms. In: Proceedings of the 1994 ACM Symposium on Applied Computing, pp. 188–193. ACM Press, New York (1994)
Cotta, C., Troya, J.M.: A Hybrid Genetic Algorithm for the 0-1 Multiple Knapsack Problem. In: Artificial Neural Networks and Genetic algorithms, vol. 3, pp. 250–254. Springer, Berlin (1998)
Yoon, Y., Kim, Y.H., Moon, B.R.: An Evolutionary Lagrangian Method for the 0/1 Multiple Knapsack Problem. In: Proceedings of the GECCO-2005, pp. 629–635. ACM Press, New York (2005)
Hiley, A., Julstrom, B.A.: The Quadratic Multiple Knapsack Problem and Three Heuristic Approaches to it. In: Proceedings of the GECCO-2006, pp. 547–552. ACM Press, New York (2006)
Falkenauer, E.: New Representations and Operators for GAs Applied to Grouping Problems. Evolutionary Computation 2, 123–144 (1992)
Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley & Sons, Chicester (1998)
Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)
Singh, A., Gupta, A.K.: Two Heuristics for the One-Dimensional Bin-Packing Problem. To appear in OR-Spectrum (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Singh, A., Baghel, A.S. (2007). A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem. In: Cotta, C., van Hemert, J. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2007. Lecture Notes in Computer Science, vol 4446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71615-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-71615-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71614-3
Online ISBN: 978-3-540-71615-0
eBook Packages: Computer ScienceComputer Science (R0)