Summary

Proceedings of the 2013 International Symposium on Nonlinear Theory and its Applications

2013

Session Number:C1L-C

Session:

Number:358

How to Decide Solutions of Quadratic Assignment Problem from Chaotic Neural Network

Takafumi Matsuura,  Tohru Ikeguchi,  

pp.358-361

Publication Date:

Online ISSN:2188-5079

DOI:10.15248/proc.2.358

PDF download (334KB)

The quadratic assignment problem (QAP) is one of famous combinatorial optimization problems which belong to a class of NP-hard. To solve the QAP, a chaotic search method which uses chaotic neural network has been proposed. In the method, chaotic dynamics of the chaotic neural network effectively controls to avoid the local minima and to search optimal or near-optimal solutions. However, it is not so easy to generate feasible solutions from the chaotic neural network, because an output of a chaotic neuron takes an analog value. Thus, for obtaining good solutions from the chaotic neural network, it is important to develop a method that always generates a feasible solution of the QAP. To generate a feasible solution of the QAP, we have already proposed a firing decision method. In this paper, to improve performances of the method, we investigate what factors are essential to the firing decision method.

[1] T. C. Koopmans and M. J. Beckmann (1957): Econometrica, 25, 53-76.

[2] J. J. Hopfield and D. W. Tank (1985), Biological Cybermetics, 52, 141-152.

[3] K. Aihara, et al. (1990), Physics Letter. A, 144, 333-340.

[4] T. Ikeguchi, et al. (2002), Proc. of ISCAS 2002, 3, 469-472.

[5] K. Sato, et al. (2001), Technical Report of IEICE, 101(465), 13-20 (in Japanese).

[6] Y. Horio et al. (2005), Neural Networks 18, 505-513.

[7] Y. Horio and K. Aihara (2008), Physica D, 237, 1215-1225.

[8] QAPLIB: http://www.opt.math.tu-graz.ac.at/qaplib/

[9] Gurobi Optimization: http://www.gurobi.com