| Article ID: | iaor20084043 |
| Country: | Netherlands |
| Volume: | 156 |
| Issue: | 1 |
| Start Page Number: | 83 |
| End Page Number: | 97 |
| Publication Date: | Dec 2007 |
| Journal: | Annals of Operations Research |
| Authors: | Schiavinotto Tommaso, Sttzle Thomas, Paquete Luis |
| Keywords: | heuristics: local search |
In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets of feasible solutions and their acceptance criterion is based on outperformance relations. Proofs of the soundness and completeness of these algorithms are given.