Related Experiment Video
Updated: May 24, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
On local search for bi-objective knapsack problems
Arnaud Liefooghe1, Luís Paquete, José Rui Figueira
1LIFL, Université Lille 1, UMR CNRS 8022, 59655 Villeneuve d'Ascq cedex, France. arnaud.liefooghe@univ-lille1.fr
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.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Optimization Problems
Application of Nonlinear Inequalities
Gaussian Elimination: Problem Solving
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Optimal Foraging