Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiex, R.M., Resende, M.G.C., Pardalos, P.M., Toraldo, G.: GRASP with path relinking for the three-index assignment problem. INFORMS J. on Computing 17(2), 224–247 (2005)
Balas, E., Landweer, P.: Traffic Assignment in Communication Satelites. Operations Research Letters 2, 141–147 (1983)
Burkard, R.E., Cela, E.: Linear Assignment Problems and Extensions. In: Pardalos, P.M., Du, D.Z. (eds.) The Handbook of Combinatorial Optimization, pp. 75–149 (1999)
Clemons, W., Grundel, D., Jeffcoat, D.: Applying simulated annealing on the multidimensional assignment problem. In: Butenko, S., Murphey, R., Pardalos, P.M. (eds.) Recent Developments in Cooperative Control and Optimization: Cooperative Systems. Springer, Heidelberg (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York (1979)
Geem, Z.W., Kim, J.H., Loganathan, G.V.: A New Heuristic Optimization Algorithm: Harmony Search. Simulations 76(2), 60–68 (2001)
Glover, F., Laguna, F.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley, Reading (1989)
Grundel, D., Krokhmal, P., Oliveira, C., Pardalos, P.: On the Number of Local Minima for the Multidimensional Assignment Problem. Journal of Combinatorial Optimization 13(1), 1–18 (2007)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)
Kammerdiner, A., Krokhmal, P., Pardalos, P.: Distribution of Hamming distances between Solutions of Multidimensional Assignment Problem. In: Hirsch, M.J., Pardalos, P.M., Murphey, R., Grundel, D. (eds.) Advances in Cooperative Control and Optimization, vol. 369. Springer, Heidelberg (2007)
Kammerdiner, A.: Multidimensional Assignment Problem. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, 2nd edn. (to appear, 2008)
Lidstrom, N., Pardalos, P., Pistoulis, L., Toraldo, G.: An approximation algorithm for the three-index assignment problem, Technical Report, INFORMS San Diego-1997, Combinatorial Optimization Cluster, SA06 (1997)
Magos, D.: Tabu search for the planar three-dimensional assignment problem. Journal of Global Optimization 8, 35–48 (1996)
Mucherino, A., Seref, O.: Monkey search: a novel metaheuristic search for global optimization. In: Seref, O., Kundakcioglu, O.E., Pardalos, P.M. (eds.) DataMining, Systems Analysis, and Optimization in Biomedicine, pp. 162–173. American Institute of Physics (2007)
Murphey, R., Pardalos, P., Pitsoulis, L.: A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. DIMACS Series, vol. 40, pp. 277–302. American Mathematical Society (1998)
Pierskalla, W.P.: The Tri-Substitution Method for Obtaining Near-Optimal Solutions to the Three-Dimensional Assignment Problem, Tech. Memo. No. 71, Operations Research Group, Case Institute of Technology, Cleveland, Ohio (October 1966)
Pierskalla, W.P.: The tri-substitution method for the three-dimensional assignment problem. Journal of Canadian Operation Research Society 5, 71–81 (1967)
Pierskalla, W.P.: The multidimensional assignment problem. Operations Research 16, 422–431 (1968)
Poore, A.B.: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Computation Optimization and Applications 3, 27–54 (1994)
Pusztaszeri, J.F., Rensing, P.E., Liebling, T.M.: Tracking Elementary Particles Near Their Primary Vertex: A Combinatorial Approach. Journal of Global Optimization 9(1), 41–64 (1996)
Robertson, A.J.: A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem. Computational Optimization and Applications 19(2), 145–164 (2001)
Seref, O., Akcali, E.: Monkey Search: A New Meta-Heuristic Approach. In: INFORMS Annual Meeting, San Jose, CA (2002)
Seref, O., Mucherino, A., Pardalos, P.M.: The Novel Meta-Heuristic Monkey Search, working paper
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kammerdiner, A.R., Mucherino, A., Pardalos, P.M. (2009). Application of Monkey Search Meta-heuristic to Solving Instances of the Multidimensional Assignment Problem. In: Hirsch, M.J., Commander, C.W., Pardalos, P.M., Murphey, R. (eds) Optimization and Cooperative Control Strategies. Lecture Notes in Control and Information Sciences, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88063-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-88063-9_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88062-2
Online ISBN: 978-3-540-88063-9
eBook Packages: EngineeringEngineering (R0)