Local Search Heuristics for the Multidimensional Assignment Problem

Authors:
G. Gutin;D. Karapetyan
Affiliations:
Department of Computer Science, Royal Holloway University of London Egham, Surrey, UK TW20 0EX;Department of Computer Science, Royal Holloway University of London Egham, Surrey, UK TW20 0EX
Venue:
Graph Theory, Computational Intelligence and Thought
Year:
2009

Citing 6
Cited 1

An algorithm for the three-index assignment problem

Operations Research
A Set of Greedy Randomized Adaptive Local Search Procedure (GRASP) Implementations for the Multidimensional Assignment Problem

Computational Optimization and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Test Problem Generator for the Multidimensional Assignment Problem

Computational Optimization and Applications
GRASP with Path Relinking for Three-Index Assignment

INFORMS Journal on Computing
Using bipartite and multidimensional matching to select the roots of a system of polynomial equations

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Solving the Multidimensional Assignment Problem by a Cross-Entropy method

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.