Best network flow bounds for the quadratic knapsack problem
COMO '86 Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms and Manufacturing Systems Design
Genetic Algorithms and Manufacturing Systems Design
Augmented Lagrangian Duality and Nondifferentiable Optimization Methods in Nonconvex Programming
Journal of Global Optimization
Exact Solution of the Quadratic Knapsack Problem
INFORMS Journal on Computing
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The quadratic multiple knapsack problem and three heuristic approaches to it
Proceedings of the 8th annual conference on Genetic and evolutionary computation
The quadratic knapsack problem-a survey
Discrete Applied Mathematics
A cross entropy algorithm for the Knapsack problem with setups
Computers and Operations Research
A new grouping genetic algorithm for the quadratic multiple knapsack problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A genetic algorithm for the quadratic multiple knapsack problem
BVAI'07 Proceedings of the 2nd international conference on Advances in brain, vision and artificial intelligence
A swarm intelligence approach to the quadratic multiple knapsack problem
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
A computational study on the quadratic knapsack problem with multiple constraints
Computers and Operations Research
A memetic algorithm for the quadratic multiple container packing problem
Applied Intelligence
A variable-grouping based genetic algorithm for large-scale integer programming
Information Sciences: an International Journal
Optimization of performance of genetic algorithm for 0-1 knapsack problems using taguchi method
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Algorithms for the bounded set-up knapsack problem
Discrete Optimization
| Hi-index | 0.01 |
The Quadratic Knapsack Problem (QKP) is one of the well-known combinatorial optimization problems. If more than one knapsack exists, then the problem is called a Quadratic Multiple Knapsack Problem (QMKP). Recently, knapsack problems with setups have been considered in the literature. In these studies, when an item is assigned to a knapsack, its setup cost for the class also has to be accounted for in the knapsack. In this study, the QMKP with setups is generalized taking into account the setup constraint, assignment conditions and the knapsack preferences of the items. The developed model is called Generalized Quadratic Multiple Knapsack Problem (G-QMKP). Since the G-QMKP is an NP-hard problem, two different meta-heuristic solution approaches are offered for solving the G-QMKP. The first is a genetic algorithm (GA), and the second is a hybrid solution approach which combines a feasible value based modified subgradient (F-MSG) algorithm and GA. The performances of the proposed solution approaches are shown by using randomly generated test instances. In addition, a case study is realized in a plastic injection molding manufacturing company. It is shown that the proposed hybrid solution approach can be successfully used for assigning jobs to machines in production with plastic injection, and good solutions can be obtained in a reasonable time for a large scale real-life problem.