par Bezerra, Leonardo;López-Ibáñez, Manuel 
;Stützle, Thomas
Référence Lecture notes in computer science, 7832 LNCS, page (85-96)
Publication Publié, 2013
;Stützle, Thomas Référence Lecture notes in computer science, 7832 LNCS, page (85-96)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | Local search techniques are increasingly often used in multi-objective combinatorial optimization due to their ability to improve the performance of metaheuristics. The efficiency of multi-objective local search techniques heavily depends on factors such as (i) neighborhood operators, (ii) pivoting rules and (iii) bias towards good regions of the objective space. In this work, we conduct an extensive experimental campaign to analyze such factors in a Pareto local search (PLS) algorithm for the bi-objective bidimensional knapsack problem (bBKP). In the first set of experiments, we investigate PLS as a stand-alone algorithm, starting from random and greedy solutions. In the second set, we analyze PLS as a post-optimization procedure. © 2013 Springer-Verlag. |
