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 Citation (Scopus)

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
StatePublished - Oct 31 2007
Externally publishedYes

Publication series

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

Fingerprint

Values
capital investment
reconstruction
experiment
trend

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

Characteristics of the distribution of hamming distance values between multidimensional assignment problem solutions. / Kammerdiner, Alla R.; Krokhmal, Pavlo A.; Pardalos, Panos M.

Advances in Cooperative Control and Optimization: Proceedings of the 7th International Conference on Cooperative Control and Optimization. ed. / Michael J. Hirsch; Panos M. Pardalos; Robert Murphey; Don Grundel. 2007. p. 339-352 (Lecture Notes in Control and Information Sciences; Vol. 369).

Research output: Chapter in Book/Report/Conference proceedingChapter

Kammerdiner, AR, Krokhmal, PA & Pardalos, PM 2007, Characteristics of the distribution of hamming distance values between multidimensional assignment problem solutions. in MJ Hirsch, PM Pardalos, R Murphey & D Grundel (eds), Advances in Cooperative Control and Optimization: Proceedings of the 7th International Conference on Cooperative Control and Optimization. Lecture Notes in Control and Information Sciences, vol. 369, pp. 339-352. https://doi.org/10.1007/978-3-540-74356-9_21
Kammerdiner AR, Krokhmal PA, Pardalos PM. Characteristics of the distribution of hamming distance values between multidimensional assignment problem solutions. In Hirsch MJ, Pardalos PM, Murphey R, Grundel D, editors, Advances in Cooperative Control and Optimization: Proceedings of the 7th International Conference on Cooperative Control and Optimization. 2007. p. 339-352. (Lecture Notes in Control and Information Sciences). https://doi.org/10.1007/978-3-540-74356-9_21
Kammerdiner, Alla R. ; Krokhmal, Pavlo A. ; Pardalos, Panos M. / Characteristics of the distribution of hamming distance values between multidimensional assignment problem solutions. Advances in Cooperative Control and Optimization: Proceedings of the 7th International Conference on Cooperative Control and Optimization. editor / Michael J. Hirsch ; Panos M. Pardalos ; Robert Murphey ; Don Grundel. 2007. pp. 339-352 (Lecture Notes in Control and Information Sciences).
@inbook{d7f26daa21114673af949666dd6b39fa,
title = "Characteristics of the distribution of hamming distance values between multidimensional assignment problem solutions",
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.",
author = "Kammerdiner, {Alla R.} and Krokhmal, {Pavlo A.} and Pardalos, {Panos M.}",
year = "2007",
month = "10",
day = "31",
doi = "10.1007/978-3-540-74356-9_21",
language = "English (US)",
isbn = "3540743545",
series = "Lecture Notes in Control and Information Sciences",
pages = "339--352",
editor = "Hirsch, {Michael J.} and Pardalos, {Panos M.} and Robert Murphey and Don Grundel",
booktitle = "Advances in Cooperative Control and Optimization",

}

TY - CHAP

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

AU - Kammerdiner, Alla R.

AU - Krokhmal, Pavlo A.

AU - Pardalos, Panos M.

PY - 2007/10/31

Y1 - 2007/10/31

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35548976196&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35548976196&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-74356-9_21

DO - 10.1007/978-3-540-74356-9_21

M3 - Chapter

AN - SCOPUS:35548976196

SN - 3540743545

SN - 9783540743545

T3 - Lecture Notes in Control and Information Sciences

SP - 339

EP - 352

BT - Advances in Cooperative Control and Optimization

A2 - Hirsch, Michael J.

A2 - Pardalos, Panos M.

A2 - Murphey, Robert

A2 - Grundel, Don

ER -