Skip to main content
SpringerLink
Log in

Test Problem Generator for the Multidimensional Assignment Problem

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

The multidimensional assignment problem (MAPs) is a higher dimensional version of the standard linear assignment problem. Test problems of known solution are useful in exercising solution methods. A method of generating an axial MAP of controllable size with a known unique solution is presented. Certain characteristics of the generated MAPs that determine realism and difficulty are investigated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo, “GRASP with path relinking for the three-index assignment problem” Technical Report, AT&T Labs Research, Florham Park, NJ 07733, 2001.

    Google Scholar 

  2. E. Balas and M.J. Saltzman, “An algorithm for the three-index assignment problem” Operations Research, vol. 39, pp. 150–161, 1991.

    MathSciNet  Google Scholar 

  3. J.E. Beasley, “OR-Library: Distributing test problems by electronic mail” Journal of the Operational Research Society, vol. 41, no. 11, pp. 1069–1072, 1990.

    Google Scholar 

  4. J.E. Beasley, OR-Library, http://www.ms.ic.ac.uk/info.html.

  5. R.E. Burkard, “Selected topics on assignment problems” Discrete Applied Mathematics, vol. 123, pp. 257–302, 2002.

    Article  Google Scholar 

  6. R.E. Burkard, E. Çela, S.E. Karisch, and F. Rendlqaplib, A Quadratic Assignment Problem Library, http://www.opt.math.tu-graz.ac.at/qaplib/.

  7. R.E. Burkard, R. Rudolf, and G.J. Woeginger, “Three-dimensional axial assignment problems with decomposible cost coefficients” Discrete Applied Mathematics, vol. 65, pp. 123–139, 1996.

    Article  Google Scholar 

  8. Y. Crama and F.C.R. Spieksma, “Approximation algorithms for three-dimensional assignment problems with triangle inequalities” European Journal of Operational Research, vol. 60, pp. 273–279, 1992.

    Article  Google Scholar 

  9. C.A. Floudas, P.M. Pardalos, C.S. Adjiman, W.R. Esposito, Z.H. Gms, S.T. Harding, J.L. Klepeis, C.A. Meyer, and C.A. Schweiger, Handbook of Test Problems in Local and Global Optimization, Kluwer, Dordrecht, Netherlands, 1999.

    Google Scholar 

  10. A.M. Frieze and J. Yadegar, “An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice” Journal of Operational Research Society, vol. 32, pp. 989–995, 1981.

    Google Scholar 

  11. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman: New York, 1979.

    Google Scholar 

  12. E.E. Lewis, Introduction to Reliability Engineering, 2nd ediition, John Wiley and Sons: New York, 1996, pp. 25–30.

    Google Scholar 

  13. D. Magos and P. Miliotis, “An algorithm for the planar three-index assignment problem” European Journal of Operational Research, vol. 77, pp. 141–153, 1994.

    Article  Google Scholar 

  14. R. Murphey, P. Pardalos, and L. Pitsoulis, “A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem” in DIMACS Series, vol. 40, American Mathematical Society, 1998, pp. 277–302.

  15. P. Pardalos and L. Pitsoulis (Eds.), Nonlinear Assignment Problems, Algorithms and Applications, Kluwer: Dordrecht, 2000, pp. 1–12.

    Google Scholar 

  16. W. Pierskalla, “The multidimensional assignment problem” Operations Research, vol. 16, pp. 422–431, 1968.

    Google Scholar 

  17. A. Poore and N. Rijavec, “A lagrangian relaxation algorithm for multidimensional assignment problems arising from multitarget tracking” Society of Industrial and Applied Mathmatics Journal on Optimization, vol. 3, pp. 544–563, 1993.

    Google Scholar 

  18. J. Pusztaszeri, P.E. Rensing, and T.M. Liebling, “Tracking elementary particles near their primary vertex: A combinatorial approach.” Journal of Global Optimization, vol. 16, pp. 422–431, 1995.

    Google Scholar 

  19. L. Yong and P.M. Pardalos, “Generating quadratic assignment test problems with know optimal permutations” Computational Optimization and Applications, vol. 1, no. 2, pp. 163–184, 1992.

    Google Scholar 

Download references

Author information

Author notes

  1. Don A. Grundel

    Present address: AFRL/MNGN, 101 W Eglin Blvd Ste 331, Eglin AFB, FL, 32542

  2. Panos M. Pardalos

    Present address: , 303 Weil Hall, 116595, Gainesville, FL, 32611

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, U.S.A.

    Don A. Grundel & Panos M. Pardalos

Authors
  1. Don A. Grundel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Don A. Grundel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grundel, D.A., Pardalos, P.M. Test Problem Generator for the Multidimensional Assignment Problem. Comput Optim Applic 30, 133–146 (2005). https://doi.org/10.1007/s10589-005-4558-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-005-4558-6

Keywords

Search

Navigation