Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Local Search Heuristics for the Multidimensional Assignment Problem
verfasst von : G. Gutin, D. Karapetyan
Erschienen in: Graph Theory, Computational Intelligence and Thought
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The Multidimensional Assignment Problem (MAP) (abbreviated
s
-AP in the case of
s
dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of
s
have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with three instance families are provided and discussed. As a result, we select dominating local search heuristics. One of the most interesting conclusions is that combination of two heuristics may yield a superior heuristic with respect to both solution quality and the running time.