A Hybrid Heuristic for Multiobjective Knapsack Problems

Some real world situations such as cargo loading and investment choice can be modeled by the knapsack problem. When more than one objective is considered, the problem becomes a multiobjective knapsack problem. In this paper, we develop a hybrid heuristic based on the combination of a multiobjective tabu search algorithm and a multiobjective genetic algorithm, and show, through experimentations, the efficiency of the proposed method.