Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Local search heuristics for the multidimensional assignment problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The Multidimensional Assignment Problem (MAP) (abbreviated 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 also have a large number of applications. We consider several known neighborhoods, generalize them and propose some new ones. The heuristics are evaluated both theoretically and experimentally and dominating algorithms are selected. We also demonstrate that a combination of two neighborhoods may yield a heuristics which is superior to both of its components.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Aiex, R.M., Resende, M.G.C., Pardalos, P.M., Toraldo, G.: Grasp with path relinking for three-index assignment. INFORMS J. Comput. 17(2), 224–247 (2005)

    Article  MathSciNet  Google Scholar 

  • Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)

    Book  MATH  Google Scholar 

  • Andrijich, S.M., Caccetta, L.: Solving the multisensor data association problem. Nonlinear Anal. 47(8), 5525–5536 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  • Balas, E., Saltzman, M.J.: An algorithm for the three-index assignment problem. Oper. Res. 39(1), 150–161 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  • Bandelt, H.J., Maas, A., Spieksma, F.C.R.: Local search heuristics for multi-index assignment problems with decomposable costs. J. Oper. Res. Soc. 55(7), 694–704 (2004)

    Article  MATH  Google Scholar 

  • Bekker, H., Braad, E.P., Goldengorin, B.: Using bipartite and multidimensional matching to select the roots of a system of polynomial equations. In: Computational Science and Its Applications—ICCSA 2005. Lecture Notes Comp. Sci., vol. 3483, pp. 397–406. Springer, Berlin (2005)

    Chapter  Google Scholar 

  • Burkard, R.E., Çela, E.: Linear assignment problems and extensions. In: Du, Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 75–149. Kluwer Academic, Dordrecht (1999)

    Google Scholar 

  • Burkard, R.E., Klinz, B., Rudolf, R.: Perspectives of Monge properties in optimization. Discrete Appl. Math. 70(2), 95–161 (1996a)

    Article  MathSciNet  MATH  Google Scholar 

  • Burkard, R.E., Rudolf, R., Woeginger, G.J.: Three-dimensional axial assignment problems with decomposable cost coefficients. Technical Report 238, Graz (1996b)

  • Clemons, W.K., Grundel, D.A., Jeffcoat, D.E.: In: Theory and Algorithms for Cooperative Systems. Applying Simulated Annealing to the Multidimensional Assignment Problem, pp. 45–61. World Scientific, Singapore (2004)

    Google Scholar 

  • Crama, Y., Spieksma, F.C.R.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur. J. Oper. Res. 60(3), 273–279 (1992)

    Article  MATH  Google Scholar 

  • Frieze, A.M., Yadegar, J.: An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice. J. Oper. Res. Soc. 32, 989–995 (1981)

    MATH  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. Freeman, New York (1979)

    MATH  Google Scholar 

  • Grundel, D.A., Pardalos, P.M.: Test problem generator for the multidimensional assignment problem. Comput. Optim. Appl. 30(2), 133–146 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Grundel, D., Oliveira, C., Pardalos, P.: Asymptotic properties of random multidimensional assignment problems. J. Optim. Theory Appl. 122(3), 33–46 (2004)

    Article  MathSciNet  Google Scholar 

  • Gutin, G., Karapetyan, D.: Greedy like algorithms for the traveling salesman problem and multidimensional assignment problem. In: Advances in Greedy Algorithms. I-Tech (2008)

  • Gutin, G., Karapetyan, D.: A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Comput. 1(1), 25–34 (2009)

    Article  Google Scholar 

  • Gutin, G., Goldengorin, B., Huang, J.: Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems. J. Heuristics 14(2), 169–181 (2008)

    Article  Google Scholar 

  • Harris, J.M., Hirst, J.L., Mossinghoff, M.J.: Combinatorics and Graph Theory. Mathematics (2008)

  • Huang, G., Lim, A.: A hybrid genetic algorithm for the three-index assignment problem. Eur. J. Oper. Res. 172(1), 249–257 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Isler, V., Khanna, S., Spletzer, J., Taylor, C.J.: Target tracking with distributed sensors: The focus of attention problem. Comput. Vis. Image Underst. J. 100(1–2), 225–247 (2005). Special Issue on Attention and Performance in Computer Vision

    Article  Google Scholar 

  • Karapetyan, D.: http://www.cs.rhul.ac.uk/Research/ToC/publications/Karapetyan/ (2009)

  • Karapetyan, D., Gutin, G., Goldengorin, B.: Empirical evaluation of construction heuristics for the multidimensional assignment problem. In: Chan, J., Daykin, J.W., Rahman, M.S. (eds.) London Algorithmics 2008: Theory and Practice. Texts in Algorithmics, pp. 107–122. College Sci. Publ., State College (2009)

    Google Scholar 

  • Krokhmal, P., Grundel, D., Pardalos, P.: Asymptotic behavior of the expected optimal value of the multidimensional assignment problem. Math. Program. 109(2–3), 525–551 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  • Kuhn, H.W.: The hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83–97 (1955)

    Article  Google Scholar 

  • Kuroki, Y., Matsui, T.: An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. Discrete Appl. Math. 157(9), 2124–2135 (2007)

    Article  MathSciNet  Google Scholar 

  • Murphey, R., Pardalos, P., Pitsoulis, L.: A GRASP for the multitarget multisensor tracking problem. Networks Discrete Math. Theor. Comput. Sci. Ser. 40, 277–302 (1998)

    MathSciNet  Google Scholar 

  • Oliveira, C.A.S., Pardalos, P.M.: Randomized parallel algorithms for the multidimensional assignment problem. Appl. Numer. Math. 49, 117–133 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  • Pardalos, P.M., Pitsoulis, L.S.: Nonlinear Assignment Problems. Springer, Berlin (2000)

    MATH  Google Scholar 

  • Pardalos, P.M., Pitsoulis, L.S.: In: Quadratic and Multidimensional Assignment Problems. Nonlinear Optimization and Applications, vol. 2, pp. 235–276. Kluwer Academic, Dordrecht (2000)

    Google Scholar 

  • Pasiliao, E.L., Pardalos, P.M., Pitsoulis, L.S.: Branch and bound algorithms for the multidimensional assignment problem. Optim. Methods Softw. 20(1), 127–143 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Pierskalla, W.P.: The multidimensional assignment problem. Oper. Res. 16, 422–431 (1968)

    Article  MATH  Google Scholar 

  • Pusztaszeri, J., Rensing, P., Liebling, Th.M.: Tracking elementary particles near their primary vertex: a combinatorial approach. J. Glob. Optim. 9, 41–64 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  • Rardin, R.L., Uzsoy, R.: Experimental evaluation of heuristic optimization algorithms: A tutorial. J. Heuristics 7(3), 261–304 (2001)

    Article  MATH  Google Scholar 

  • Robertson, A.J.: A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem. Comput. Optim. Appl. 19(2), 145–164 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  • Spieksma, F.C.R.: In: Multi Index Assignment Problems: Complexity, Approximation, Applications. Nonlinear Assignment Problems, Algorithms and Application, pp. 1–12. Kluwer Academic, Norwell (2000)

    Google Scholar 

  • Spieksma, F., Woeginger, G.: Geometric three-dimensional assignment problems. Eur. J. Oper. Res. 91, 611–618 (1996)

    Article  MATH  Google Scholar 

  • Talbi, E.-G.: Metaheuristics: From Design to Implementation. Wiley, New York (2009)

    MATH  Google Scholar 

  • Veenman, C.J., Reinders, M.J.T., Backer, E.: Establishing motion correspondence using extended temporal scope. Artif. Intell. 145(1–2), 227–243 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Royal Holloway, University of London, Egham Hill, UK

    Daniel Karapetyan & Gregory Gutin

Authors
  1. Daniel Karapetyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gregory Gutin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gregory Gutin.

Additional information

A preliminary version of this paper was published in Golumbic Festschrift, volume 5420 of Lect. Notes Comput. Sci., pages 100–115, Springer, 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karapetyan, D., Gutin, G. Local search heuristics for the multidimensional assignment problem. J Heuristics 17, 201–249 (2011). https://doi.org/10.1007/s10732-010-9133-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-010-9133-3

Keywords

Search

Navigation