title: On local search for bi-objective knapsack problems.
abstract: In this article, a local search approach is proposed for three variants of the bi-objective binary knapsack problem, with the aim of maximizing the total profit and minimizing the total weight. First, an experimental study on a given structural property of connectedness of the efficient set is conducted. Based on this property, a local search algorithm is proposed and its performance is compared to exact algorithms in terms of runtime and quality metrics. The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact algorithms.
authors.affiliation: LIFL, Université Lille 1, UMR CNRS 8022, 59655 Villeneuve d'Ascq cedex, France. arnaud.liefooghe@univ-lille1.fr
authors.forename: Arnaud
authors.initials: A
authors.lastname: Liefooghe
authors.forename: Luís
authors.initials: L
authors.lastname: Paquete
authors.forename: José Rui
authors.initials: JR
authors.lastname: Figueira
mesh_terms: D000465:Algorithms; D008962:Models, Theoretical