Presentation 2007-01-17
Effective Search with Hopping Chaos for Hopfield Neural Network Solving QAP
Yoshifumi TADA, Yoko UWATE, Yoshifumi NISHIO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The neural network is important for solving combinatorial optimization problem. In our past study, we solved Quadratic Assignment Problem by Hopfield neural network with each noise. Sometimes even if the noise injected to Hopfield Neural Network, the solution can not local minimum. Therefore the network often can not find many solutions. In this study, we investigate effective search with hopping chaos for Hopfield Neural Networks solving combinatorial optimization problems.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Hopping chaos / QAP / Hopfield NN
Paper # NLP2006-113
Date of Issue

Conference Information
Committee NLP
Conference Date 2007/1/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Effective Search with Hopping Chaos for Hopfield Neural Network Solving QAP
Sub Title (in English)
Keyword(1) Hopping chaos
Keyword(2) QAP
Keyword(3) Hopfield NN
1st Author's Name Yoshifumi TADA
1st Author's Affiliation Faculty of Engineering, Tokushima University()
2nd Author's Name Yoko UWATE
2nd Author's Affiliation Faculty of Engineering, Tokushima University
3rd Author's Name Yoshifumi NISHIO
3rd Author's Affiliation Faculty of Engineering, Tokushima University
Date 2007-01-17
Paper # NLP2006-113
Volume (vol) vol.106
Number (no) 451
Page pp.pp.-
#Pages 4
Date of Issue