Section: New Results

Connectedness and Local Search for Bi-objective Knapsack Problems

Participant : A. Liefooghe.

In [33] , we report an experimental study on a given structural property of connectedness of the set of Pareto-optimal solutions for two variants of the bi-objective knapsack problem. A local search algorithm that explores this property is then proposed and its performance is compared against exact algorithms in terms of running time and number of optimal solutions found. The experimental results indicate that this simple local search algorithm is able to find a representative set of Pareto-optimal solutions in most of the cases, and in much less time than exact approaches.