Computer Science – Data Structures and Algorithms
Scientific paper
2009-06-04
Lecture Notes in Computer Science 5752 (2009) 125-129
Computer Science
Data Structures and Algorithms
14 pages
Scientific paper
10.1007/978-3-642-03751-1_12
The Multidimensional Assignment Problem (MAP or 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. In this paper we propose a memetic algorithm for MAP that is a combination of a genetic algorithm with a local search procedure. The main contribution of the paper is an idea of dynamically adjusted generation size, that yields an outstanding flexibility of the algorithm to perform well for both small and large fixed running times. The results of computational experiments for several instance families show that the proposed algorithm produces solutions of very high quality in a reasonable time and outperforms the state-of-the art 3-AP memetic algorithm.
Gutin Gregory
Karapetyan Daniel
No associations
LandOfFree
A Memetic Algorithm 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 A Memetic Algorithm for the Multidimensional Assignment Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Memetic Algorithm for the Multidimensional Assignment Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-494496