Connectedness and local search for bicriteria knapsack problems

Authors:
Arnaud Liefooghe;Luís Paquete;Marco Simões;José R. Figueira
Affiliations:
Université Lille 1, LIFL - CNRS - INRIA Lille-Nord Europe, France;CISUC, Department of Informatics Engineering, University of Coimbra, Portugal;CISUC, Department of Informatics Engineering, University of Coimbra, Portugal;INPL, École des Mines de Nancy, Laboratoire LORIA, France
Venue:
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Year:
2011

Citing 5
Cited 1

On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Probabilistic analysis of knapsack core algorithms

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multicriteria Optimization

Multicriteria Optimization
Analyzing the effect of objective correlation on the efficient set of MNK-Landscapes

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization

On local search for bi-objective knapsack problems

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article reports an experimental study on a given structural property of connectedness of optimal solutions for two variants of the bicriteria 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 optimal solutions in most of the cases, and in much less time than exact approaches.