Characteristics of the distribution of hamming distance values between multidimensional assignment problem solutions

Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. Pardalos

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationAdvances in Cooperative Control and Optimization
Subtitle of host publicationProceedings of the 7th International Conference on Cooperative Control and Optimization
EditorsMichael J. Hirsch, Panos M. Pardalos, Robert Murphey, Don Grundel
Pages339-352
Number of pages14
DOIs
Publication statusPublished - Oct 31 2007
Externally publishedYes

Publication series

NameLecture Notes in Control and Information Sciences
Volume369
ISSN (Print)0170-8643

    Fingerprint

ASJC Scopus subject areas

  • Library and Information Sciences

Cite this

Kammerdiner, A. R., Krokhmal, P. A., & Pardalos, P. M. (2007). Characteristics of the distribution of hamming distance values between multidimensional assignment problem solutions. In M. J. Hirsch, P. M. Pardalos, R. Murphey, & D. Grundel (Eds.), Advances in Cooperative Control and Optimization: Proceedings of the 7th International Conference on Cooperative Control and Optimization (pp. 339-352). (Lecture Notes in Control and Information Sciences; Vol. 369). https://doi.org/10.1007/978-3-540-74356-9_21