Performance of chaos and burst noises injected to the Hopfield NN for quadratic assignment problems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E87-A, Issue 4, 2004, Pages 937-943

  Uwate, Yoko ^a   Nishio, Yoshifumi ^a   Ueta, Tetsushi ^a   Kawabe, Tohru ^b   Ikeguchi, Tohru ^c  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

^b UNIVERSITY OF TSUKUBA   (Japan)

^c SAITAMA UNIVERSITY   (Japan)

Author keywords

Burst noise; Chaos; Combinatorial optimization problems; Intermittency; Neural network; QAP

Indexed keywords

CHAOS THEORY; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; CORRELATION METHODS; LOGISTICS; MAPS; MATHEMATICAL MODELS; NEURAL NETWORKS; OPTIMIZATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

BURST NOISE; COMBINATORIAL OPTIMIZATION PROBLEMS; INTERMITTENCY; QUADRATURE ASSIGNMENT PROBLEMS (QAP);

SPURIOUS SIGNAL NOISE;

EID: 2342627371     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (8)

1. J.J. Hopfield, "Neurons with graded response have collective computational properties like those of two-state neurons," Proc. Natl. Acad. Sci. USA, vol.81, pp.3088-3092, 1984.
2. Y. Hayakawa and Y. Sawada, "Effects of the chaotic noise on the performance of a neural network model for optimization problems," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol.51, no.4, pp.2693-2696, April 1995.
3. M. Hasegawa, T. Ikeguchi, T. Matozaki, and K. Aihara, "An analysis on additive effects of nonlinear dynamics for combinatorial optimization," IEICE Trans. Fundamentals, vol.E80-A, no.1, pp.206-213, Jan. 1997.
4. M.C. Jeruchim, P. Balaban, and K.S. Shanmugan, Simulation of Communication Systems, pp.245-247, Plenum Press, New York, 1992.
5. P.M. Hahn, W.L. Hightower, T.A. Johnson, M. Guignard-Spielberg, and C. Roucairol, "A lower bound for the quadratic assignment problem based on a level-2 reformulation-linearization technique," University of Pennsylvania, Systems Engineering Department Report, 2001.
6. K. Anstreicher, N. Brixius, J.-P. Goux, and J. Linderoth, "QAP and other hard problems," http://www-unix.mcs.anl.gov/metaneos/nug30/qap-tsp. html
7. R.E. Berkard, S.E. Karisch, and F. Rendl, "QAPLIB - A quadratic assignment problem library," http://www.opt.math.tu-graz.ac.at/qaplib
8. K. Sato, T. Ikeguchi, M. Hasegawa, and K. Aihara, "An optimization method for quadratic assignment problems by chaotic dynamics and its characterization by Lyapunov dimensions," IEICE Technical Report, NLP64-13, 2001.