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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Gutin, G., & Karapetyan, D. (2009). A memetic algorithm for the multidimensional assignment problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5752 LNCS, pp. 125–129). https://doi.org/10.1007/978-3-642-03751-1_12
Mendeley helps you to discover research relevant for your work.