|
|||||
|
|
MCS—A new algorithm for multicriteria optimisation in constraint programming |
|
| Authors: | F Le Huédé M Grabisch C Labreuche P Savéant |
| Institution: | (1) THALES Research and Technology France, domaine de Corbeville, 91401 Orsay cedex, France;(2) LIP 6, Université Pierre et Marie Curie (UPMC), Université Paris I Panthéon-Sorbonne, 8, rue du Capitaine Scott 75015, Paris, France |
| 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. |
| Keywords: | Multicriteria optimization Multicriteria decision making Constraint programming |
| 本文献已被 SpringerLink 等数据库收录！ | |