Final published version
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter
}
TY - CHAP
T1 - Exact methods for multi-objective combinatorial optimisation
AU - Ehrgott, Matthias
AU - Gandibleux, Xavier
AU - Przybylski, Anthony
PY - 2016/5/15
Y1 - 2016/5/15
N2 - 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.
AB - 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.
KW - Multi-objective optimisation
KW - Combinatorial optimisation
KW - Exact methods
KW - Scalarisation
KW - Branch and bound
KW - Two-phase method
U2 - 10.1007/978-1-4939-3094-4_19
DO - 10.1007/978-1-4939-3094-4_19
M3 - Chapter
SN - 9781493930937
T3 - International Series in Operations Research and Management Science
SP - 817
EP - 850
BT - Multiple criteria decision analysis
A2 - Greco, Salvatore
A2 - Ehrgott, Matthias
A2 - Figueira, Jose Rui
PB - Springer
CY - New York
ER -