Local Search Heuristics For The Multidimensional Assignment Problem

Details Local Search Heuristics For The Multidimensional Assignment Problem Local Search Heuristics For The Multidimensional Assignment Problem

2008-06-19

arxiv.org/abs/0806.3258v6

Computer Science

Data Structures and Algorithms

30 pages. A preliminary version is published in volume 5420 of Lecture Notes Comp. Sci., pages 100-115, 2009

Scientific paper

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 a combination of two neighborhoods may yield a heuristics which is superior to both of its components.

Affiliated with

Also associated with

No associations

Rating

Local Search Heuristics For The Multidimensional Assignment Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Local Search Heuristics For The Multidimensional Assignment Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local Search Heuristics For The Multidimensional Assignment Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563711