Skip to main content
SpringerLink
Log in
Book cover

Advances in Cooperative Control and Optimization pp 339–352Cite as

Characteristics of the Distribution of Hamming Distance Values Between Multidimensional Assignment Problem Solutions

  • Conference paper

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 369))

Abstract

The Multidimensional Assignment Problem (MAP) is a combinatorial optimization problem that arises in many important practical areas including capital investment, dynamic facility location, elementary particle path reconstruction, multiple target tracking and sensor fusion. Since the solution space of the MAP increases exponentially with the problem parameters, and the problem has exponentially many local minima, only moderate-sized instances can be solved to optimality. We investigate the combinatorial structure of the solution space by extending a concept of Hamming distance. The results of numerical experiments indicate a linear trend for average Hamming distance to optimal solution for the cases where one of the parameters is fixed.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Poore, A.B.: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Computation Optimization and Applications 3, 27–54 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Pierskalla, W.P.: The tri-substitution method for the three-dimensional assignment problem. Journal of Canadian Operation Research Society 5, 71–81 (1967)

    Google Scholar 

  3. Balas, E., Landweer, P.: Traffic Assignment in Communication Satelites. Operations Research Letters 2, 141–147 (1983)

    Article  MATH  Google Scholar 

  4. 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)

    Article  MATH  MathSciNet  Google Scholar 

  5. Grundel, D., Krokhmal, P., Oliveira, C., Pardalos, P.: On the Number of Local Minima for the Multidimensional Assignment Problem. Journal of Combinatorial Optimization (to appear, 2006)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. Pierskalla, W.P.: The multidimensional assignment problem. Operations Research 16, 422–431 (1968)

    Article  MATH  Google Scholar 

  8. Balas, E., Saltzman, M.J.: An algorithm for three-index assignment problem. Operations Research 39, 150–161 (1991)

    MATH  MathSciNet  Google Scholar 

  9. Vlach, M.: Branch and bound method for the three-index assignment problem. Economicko-Matematicky Obzor 3, 181–191 (1967)

    MathSciNet  Google Scholar 

  10. Magos, D., Miliotis, P.: An algorithm for the planar three-index assignment problem. European Journal of Operational Research 77, 141–153 (1994)

    Article  MATH  Google Scholar 

  11. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freedman and Company (1979)

    Google Scholar 

  12. Murphey, R., Pardalos, P., Pitsoulis, L.: A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In: DIMACS Series, vol. 40, pp. 277–302. American Mathematical Society (1998)

    Google Scholar 

  13. 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 Series: Cooperative Systems, vol. 3 (2004)

    Google Scholar 

  14. 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)

    Article  MathSciNet  Google Scholar 

  15. Lidstrom, N., Pardalos, P., Pistoulis, L., Toraldo, G.: An approximation algorithm for the three-index assignment problem. Technical Report (1997)

    Google Scholar 

  16. Magos, D.: Tabu search for the planar three-dimensional assignment problem. Journal of Global Optimization 8, 35–48 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  17. Hamming, R.W.: Error Detecting and Error Correcting Codes. Bell System Technical Journal 26(2), 147–160 (1950)

    MathSciNet  Google Scholar 

  18. Matsumoto, R., Kurosawa, K., Itoh, T., Konno, T., Uyematsu, T.: Primal-dual distance bounds of linear codes with application to cryptography. IEEE Trans. Inform. Theory 52(9), 4251–4256 (2006)

    Article  MathSciNet  Google Scholar 

  19. Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation 4(4), 337–352 (2000)

    Article  Google Scholar 

  20. Jonker, R., Volgenant, A.: A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing 38, 325–340 (1987)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Florida, Gainesville, FL,  

    Alla R. Kammerdiner & Panos M. Pardalos

  2. University of Iowa, Iowa City, IA,  

    Pavlo A. Krokhmal

Authors
  1. Alla R. Kammerdiner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavlo A. Krokhmal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Panos M. Pardalos Robert Murphey Don Grundel Michael J. Hirsch

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kammerdiner, A.R., Krokhmal, P.A., Pardalos, P.M. (2007). Characteristics of the Distribution of Hamming Distance Values Between Multidimensional Assignment Problem Solutions. In: Pardalos, P.M., Murphey, R., Grundel, D., Hirsch, M.J. (eds) Advances in Cooperative Control and Optimization. Lecture Notes in Control and Information Sciences, vol 369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74356-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74356-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74354-5

  • Online ISBN: 978-3-540-74356-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation