### 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 language | English (US) |
---|---|

Title of host publication | Advances in Cooperative Control and Optimization |

Subtitle of host publication | Proceedings of the 7th International Conference on Cooperative Control and Optimization |

Editors | Michael J. Hirsch, Panos M. Pardalos, Robert Murphey, Don Grundel |

Pages | 339-352 |

Number of pages | 14 |

DOIs | |

State | Published - Oct 31 2007 |

Externally published | Yes |

### Publication series

Name | Lecture Notes in Control and Information Sciences |
---|---|

Volume | 369 |

ISSN (Print) | 0170-8643 |

### ASJC Scopus subject areas

- Library and Information Sciences

## Fingerprint Dive into the research topics of 'Characteristics of the distribution of hamming distance values between multidimensional assignment problem solutions'. Together they form a unique fingerprint.

## Cite this

*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