Applying Algorithm Selection - a Case Study for the Generalised Assignment Problem

Applying Algorithm Selection - a Case Study for the Generalised Assignment Problem

© 2018 Elsevier B.V. Many combinatorial optimisation problems are NP-Hard. Yet in practice high quality solutions are often obtained by (meta)heuristics. These work well in some cases, but not in others, indicating a potential for algorithm selection. In this extended abstract is discussed how to ap...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronic Notes in Discrete Mathematics 2018-08, Vol.69, p.205-212
Hauptverfasser: Degroote, H, González-Velarde, J.L, De Causmaecker, P
Format: Artikel
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:© 2018 Elsevier B.V. Many combinatorial optimisation problems are NP-Hard. Yet in practice high quality solutions are often obtained by (meta)heuristics. These work well in some cases, but not in others, indicating a potential for algorithm selection. In this extended abstract is discussed how to apply algorithm selection to a combinatorial optimisation problem and which challenges arise when doing so. The generalised assignment problem is used as case study.