Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1162/EVCO_a_00074 | Evolutionary Computation |
Keywords | Field | DocType |
structural property,structural analysis,population-based local search,total profit,connectedness,efficient set,exact algorithm,total weight,multi-objective combinatorial optimization,knapsack problems,local search approach,experimental study,bi-objective knapsack problem,local search algorithm,simple local search algorithm,profitability,structure analysis,knapsack problem,combinatorial optimization,local search | Social connectedness,Mathematical optimization,Guided Local Search,Beam search,Continuous knapsack problem,Local search (optimization),Knapsack problem,Mathematics,Iterated local search,Binary number | Journal |
Volume | Issue | ISSN |
21 | 1 | 1530-9304 |
Citations | PageRank | References |
7 | 0.60 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arnaud Liefooghe | 1 | 416 | 39.20 |
| Luís Paquete | 2 | 427 | 25.36 |
| José Rui Figueira | 3 | 852 | 59.84 |