Application of Monkey Search Meta-Heuristic to Solving Instances of the Multidimensional Assignment Problem
A.R. Kammerdiner, A. Mucherino, P.M. Pardalos

This study applies a novel metaheuristic approach called Monkey Search for solving instances of the Multidimensional Assignment Problem (MAP). Monkey Search is a global optimization technique inspired by the behavior of a monkey climbing trees. The combinatorial formulation of the MAP in order to incorporate the matrix representation of feasible solutions is considered. The developed software procedure is tested on randomly generated instances of the MAP, and the results of the numerical experiments are presented in this study.