Approximative solution methods for multiobjective combinatorial optimization

Approximative solution methods for multiobjective combinatorial optimization

0.00 Avg rating0 Votes
Article ID: iaor2005747
Country: Spain
Volume: 12
Issue: 1
Start Page Number: 1
End Page Number: 89
Publication Date: Jun 2004
Journal: TOP
Authors: ,
Keywords: calculus of variations, heuristics
Abstract:

In this paper we present a review of approximative solution methods, that is, heuristics and metaheuristics designed for the solution of multiobjective combinatorial optimization problems (MOCO). First, we discuss questions related to approximation in this context, such as performance ratios, bounds, and quality measures. We give some examples of heuristics proposed for the solution of MOCO problems. The main part of the paper covers metaheuristics and more precisely non-evolutionary methods. The pioneering methods and their derivatives are described in a unified way. We provide an algorithmic presentation of each of the methods together with examples of applications, extensions, and a bibliographic note. Finally, we outline trends in this area.

Reviews

Required fields are marked *. Your email address will not be published.