Home > Research > Publications & Outputs > Exact methods for multi-objective combinatorial...

Links

Text available via DOI:

View graph of relations

Exact methods for multi-objective combinatorial optimisation

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter

Published
Close
NullPointerException

Abstract

In this chapter we consider multi-objective optimisation problems with a combinatorial structure. Such problems have a discrete feasible set and can be formulated as integer (usually binary) optimisation problems with multiple (integer valued) objectives. We focus on a review of exact methods to solve such problems. First, we provide definitions of the most important classes of solutions and explore properties of such problems and their solution sets. Then we discuss the most common approaches to solve multi-objective combinatorial optimisation problems. These approaches include extensions of single objective algorithms, scalarisation methods, the two-phase method and multi-objective branch and bound. For each of the approaches we provide references to specific algorithms found in the literature. We end the chapter with a description of some other algorithmic approaches for MOCO problems and conclusions suggesting directions for future research.