Local search heuristics for the multidimensional assignment problem

Authors:
Daniel Karapetyan;Gregory Gutin
Affiliations:
Royal Holloway, University of London, Egham Hill, UK;Royal Holloway, University of London, Egham Hill, UK
Venue:
Journal of Heuristics
Year:
2011

Citing 16
Cited 1

An algorithm for the three-index assignment problem

Operations Research
Perspectives of Monge properties in optimization

Discrete Applied Mathematics
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
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
Establishing motion correspondence using extended temporal scope

Artificial Intelligence
Randomized parallel algorithms for the multidimensional assignment problem

Applied Numerical Mathematics - Numerical algorithms, parallelism and applications
Test Problem Generator for the Multidimensional Assignment Problem

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

INFORMS Journal on Computing
Nonlinear Assignment Problems: Algorithms and Applications (Combinatorial Optimization)

Nonlinear Assignment Problems: Algorithms and Applications (Combinatorial Optimization)
Asymptotic behavior of the expected optimal value of the multidimensional assignment problem

Mathematical Programming: Series A and B
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems

Journal of Heuristics
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors

Discrete Applied Mathematics
Target tracking with distributed sensors: The focus of attention problem

Computer Vision and Image Understanding - Special issue: Attention and performance in computer vision
Metaheuristics: From Design to Implementation

Metaheuristics: From Design to Implementation
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

A new approach to population sizing for memetic algorithms: A case study for the multidimensional assignment problem

Evolutionary Computation

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 also have a large number of applications. We consider several known neighborhoods, generalize them and propose some new ones. The heuristics are evaluated both theoretically and experimentally and dominating algorithms are selected. We also demonstrate that a combination of two neighborhoods may yield a heuristics which is superior to both of its components.