Skip to Main content Skip to Navigation
Journal articles

MCS - a new algorithm for Multicriteria Optimisation in Constraint Programming

Fabien Lehuédé 1, * Michel Grabisch 2 Christophe Labreuche 3 Pierre Savéant 4
* Corresponding author
1 SLP - Systèmes Logistiques et de Production
IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch \& Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either complete or partial search.
Document type :
Journal articles
Complete list of metadatas
Contributor : Fabien Lehuédé <>
Submitted on : Tuesday, September 7, 2010 - 2:42:59 PM
Last modification on : Thursday, July 2, 2020 - 12:48:01 PM

Links full text



Fabien Lehuédé, Michel Grabisch, Christophe Labreuche, Pierre Savéant. MCS - a new algorithm for Multicriteria Optimisation in Constraint Programming. Annals of Operations Research, Springer Verlag, 2006, 147 (1), pp.143-174. ⟨10.1007/s10479-006-0064-1⟩. ⟨hal-00515579⟩



Record views