Abstract
The multidimensional assignment problem (MAP) is an NP-hard combinatorial optimization problem occurring in applications such as data association and target tracking. In this paper, we investigate characteristics of the mean optimal solution values for random MAPs with axial constraints. Throughout the study, we consider cost coefficients taken from three different random distributions: uniform, exponential and standard normal. In the cases of uniform and exponential costs, experimental data indicates that the mean optimal value converges to zero when the problem size increases. We give a short proof of this result for the case of exponentially distributed costs when the number of elements in each dimension is restricted to two. In the case of standard normal costs, experimental data indicates the mean optimal value goes to negative infinity with increasing problem size. Using curve fitting techniques, we develop numerical estimates of the mean optimal value for various sized problems. The experiments indicate that numerical estimates are quite accurate in predicting the optimal solution value of a random instance of the MAP.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Aldous, “Asymptotics in the random assignment problem,” Probability Theory and Related Fields, vol. 93, pp. 507–534, 1992.
S.M. Andrijich and L. Caccetta, “Solving the multisensor data association problem,” Nonlinear Analysis, vol. 47, pp. 5525–5536, 2001.
D. Coppersmith and G. Sorkin, “Constructive bounds and exact expectations for the random assignment problem,” Random Structures and Algorithms, vol. 15, pp. 133–144, 1999.
D. Coppersmith and G. Sorkin, “On the expected incremental cost of a minimum assignment,” Technical Report, IBM T.J. Watson Research Center, 1999.
H. David, Order Statistics, John Wiley and Sons: New York, 1970.
Don Grundel, Carlos A.S. Oliveira, and Panos M. Pardalos, “Asymptotic properties of random multidimensional assignment problems,” Journal of Optimization Theory and Applications, vol. 122, no. 3, 2004.
Pierre Hansen and Nenad Mladenović, “Variable neighborhood search,” in Handbook of Applied Optimization, Panos M. Pardalos and Mauricio G. C. Resende, (Eds.), Oxford University Press: New York, NY, 2002, Chap. 3.6.9, pp. 221–234..
R.M. Karp, “An upper bound on the expected cost of an optimal assignment,” in Discrete Algorithms and Complexity: Proceedings of the Japan-US Joint Seminar, D. Johnson et al. (Eds.), Academic Press: New York, 1987, pp. 1–4.
T. Kirubarajan, Y. Bar-Shalom, and K.R. Pattipati, “Multiassignment for tracking a large number of overlapping objects,” IEEE Trans. Aerospace and Electronic Systems, vol. 37, no. 1, pp. 2–21, 2001.
A.M. Law and W.D. Kelton, Simulation Modeling and Analysis, 2nd edn., McGraw-Hill, Inc.: New York, 1991.
A.J. Lazarus, “The assignment problem with uniform (0,1) cost matrix,” Master’s Thesis, Dept. of Mathematics, Princeton University, 1979.
S. Linusson and J. Wästlund, “A proof of Parisi’s conjecture on the random assignment problem,” Available at http://www.mai.liu.se/jowas/, 2003.
Mézard and Parisi, “Replicas and optimization,” J. Phys. Letters, vol. 46, pp. 771–778, 1985.
Mézard and Parisi, “On the solution of the random link matching problems,” J. Phys. Letters, vol. 48, pp. 1451–1459, 1987.
C. Nair, B. Prabhakar, and M. Sharma, “A proof of the conjecture due to parisi for the finite random assignment problem,” Available at http://www.stanford.edu/~balaji/rap.html, 2003.
B. Olin, “Asymptotic properties of random assignment problems,” PhD Thesis, Kungl Tekniska Högskolan, Stockholm, Sweden, 1992.
P.M. Pardalos and K.G. Ramakrishnan, “On the expected optimal value of random assignment problems: Experimental results and open questions,” Computational Optimization and Applications, vol. 2, pp. 261–271, 1993.
Eduardo L. Pasiliao, “Algorithms for multidimensional assignment problems,” PhD Thesis, Department of Industrial and Systems Engineering, University of Florida, Gainesville FL, 2003.
W.P. Pierskalla, “The multidimensional assignment problem,” Opera J., vol. 5, pp. 71–81, 1967.
A.B. Poore, N. Rijavec, M. Liggins, and V. Vannicola, “Data association problems posed as multidimensional assignment Problems: problem formulation,” in Signal and Data Processing of Small Targets, O.E. Drummond, (Ed.), SPIE: Bellingham, WA, 1993, pp. 552–561.
J. Pusztaszeri, P.E. Rensing, and T.M. Liebling, “Tracking elementary particles near their primary vertex: A combinatorial approach,” Journal of Global Optimization, vol. 9, no. 1, pp. 41–64, 1996.
W. Szpankowski, “Average case analysis of algorithms,” in Handbook of Algorithms and Theory of Computation, M. Atallah, (Ed.), CRC Press: Boca Raton, FL, 1998, pp. 14.1–14.38.
D.W. Walkup, “On the expected value of a random assignment problem,” SIAM Journal of Computing, vol. 8, pp. 440–442, 1979.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Grundel, D., Oliveira, C.A.S., Pardalos, P.M. et al. Asymptotic Results for Random Multidimensional Assignment Problems. Comput Optim Applic 31, 275–293 (2005). https://doi.org/10.1007/s10589-005-3227-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-005-3227-0