, Volume 12, Issue 1, pp 1–63

Approximative solution methods for multiobjective combinatorial optimization

  • Matthias Ehrgott
  • Xavier Gandibleux


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.

Key Words

Multiobjective optimization combinatorial optimization heuristics metaheuristics approximation 

AMS subject classification

90C29 90C27 90C59 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Sociedad de Estadística e Investigación Operativa 2004

Authors and Affiliations

  • Matthias Ehrgott
    • 1
  • Xavier Gandibleux
    • 2
  1. 1.Department of Engineering ScienceUniversity of AucklandAucklandNew Zealand
  2. 2.LAMIH — UMR CNRS 8530University of Valenciennes, Campus “Le Mont Houy”Valenciennes cedex 9France

Personalised recommendations