Approximative solution methods for multiobjective combinatorial optimization - Archive ouverte HAL Access content directly
Journal Articles TOP Journal Year : 2004

Approximative solution methods for multiobjective combinatorial optimization

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.

Dates and versions

hal-00462043 , version 1 (08-03-2010)

Identifiers

Cite

Matthias Ehrgott, Xavier Gandibleux. Approximative solution methods for multiobjective combinatorial optimization. TOP Journal, 2004, 12 (1), pp.1-63. ⟨10.1007/BF02578918⟩. ⟨hal-00462043⟩
155 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More