Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems

This paper deals with the problem of inaccuracy of the solutions generated by metaheuristic approaches for combinatorial optimization bi-criteria {0, 1}-knapsack problems. A hybrid approach which combines systematic and heuristic searches is proposed to reduce that inaccuracy in the context of a scatter search method. The components of this method are used to determine regions in the decision space to be systematically searched. Comparisons with small and medium size instances solved by exact methods are presented. Large size instances are also considered and the quality of the approximation is evaluated by taking into account the proximity to the upper frontier, devised by the linear relaxation, and the diversity of the solutions. Comparisons with two other well-known metaheuristics are also performed. The results show the effectiveness of the proposed approach for both small/medium and large size instances.