Solving the Generalized Quadratic Multiple Knapsack Problem by Using F-MSG Algorithm (original) (raw)

Abstract

The quadratic multiple knapsack problem (QMKP) is a generalization of the quadratic knapsack problem from a single knapsack to k knapsacks. In this study, the mathematical model of the QMKP is generalized as covering the constraints that we may face in real life problems. A new hybrid algorithm which combines F-MSG algorithm and genetic algorithm is proposed to solve the Generalized QMKP (GQMKP). The performance of the F-MSG is analyzed and compared by using randomly generated test instances. Keywords: generalized quadratic multiple knapsack problem (GQMKP), F-MSG (modified subgradient algorithm based on feasible values), genetic algorithm (GA).

Aydin Sipahioglu hasn't uploaded this paper.

Let Aydin know you want this paper to be uploaded.

Ask for this paper to be uploaded.