Regular Section
Chaotic Neurodynamical search with small number of neurons for solving QAP
2017 Volume 8 Issue 3 Pages 255-265
Details
2017 Volume 8 Issue 3 Pages 255-265
Quadratic Assignment Problem (QAP) is one of the combinatorial optimization problems which are classified into Nondeterministic Polynomial time solvable (NP)-hard problems. Therefore, it is important to develop algorithms for finding good approximate solutions in short time. In this paper, we proposed an algorithm for approximately solving QAP by using chaotic neurodynamics. The proposed algorithm has three characteristics. First, compared with the conventional method, the number of neurons was substantially reduced. Second, the effect of external inputs to neurons was changed. Third, a new parameter tuning method was introduced. As a result, our algorithm can find good solutions compared with the conventional method using chaotic neurodynamics.
