MCS—A new algorithm for multicriteria optimisation in constraint programming

MCS—A new algorithm for multicriteria optimisation in constraint programming

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 s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research 2006-10, Vol.147 (1), p.143-174
Hauptverfasser: Huédé, F. Le, Grabisch, M., Labreuche, C., Savéant, P.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Automation
Branch & bound algorithms
Computer Science
Heuristic
Multiple criteria decision making
Operations Research
Optimization
Pareto optimum
Preferences
Studies
Tradeoff analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. [PUBLICATION ABSTRACT]
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-006-0064-1