An Improved Genetic Algorithm for Multidimensional

DOI

10.2991/iske.2007.204How to use a DOI?

Keywords

multidimensional assignment problem; improved genetic algorithm; heuristic searching algorithm; solution space

Abstract

This paper mainly studies on the valid solution algorithm for multidimensional assignment problem of data association, proposes a heuristic searching algorithm for multidimensional assignment problem on the basis of order-searching algorithm and m-best algorithm, and accordingly presents a heuristic searching genetic algorithm for multidimensional assignment by fusing the heuristic searching algorithm and the genetic algorithm efficiently. The later algorithm can not only search the whole solution space quickly and efficiently by using the heuristic searching algorithm, but also can memorize and improve the better solution obtained in the initial step by using cross and mutation operations. So the convergence speed is accelerated and the accuracy of the convergence is improved. Simulation results show that the new algorithms are feasible and effective.

Copyright

© 2007, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Li Zhou
PY  - 2007/10
DA  - 2007/10
TI  - An Improved Genetic Algorithm for Multidimensional
BT  - Proceedings of the 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007)
PB  - Atlantis Press
SP  - 1195
EP  - 1199
SN  - 1951-6851
UR  - https://doi.org/10.2991/iske.2007.204
DO  - 10.2991/iske.2007.204
ID  - Zhou2007/10
ER  -