Presentation 2006-03-20
CHAOSOM and its Application to Traveling Salesman Problem
Haruna MATSUSHITA, Yoshifumi NISHIO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this study, we try to implant chaotic features into the learning algorithm of self-organizing map. We call this concept as Chaotic SOM (CHAOSOM). As a first step to realize CHAOSOM, we consider the case that learning rate and neighboring coefficient of SOM are refreshed by chaotic pulses generated by the Hodgkin-Huxley equation. We apply the CHAOSOM to solve a traveling salesman problem and confirm that the chaotic feature improves the performance.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) self-organizing map (SOM) / chaos / Hodgkin-Huxley equation / traveling salesman problem
Paper # NLP2005-148
Date of Issue

Conference Information
Committee NLP
Conference Date 2006/3/13(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 ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) CHAOSOM and its Application to Traveling Salesman Problem
Sub Title (in English)
Keyword(1) self-organizing map (SOM)
Keyword(2) chaos
Keyword(3) Hodgkin-Huxley equation
Keyword(4) traveling salesman problem
1st Author's Name Haruna MATSUSHITA
1st Author's Affiliation Department of Electrical and Electronic Engineering, Tokushima University()
2nd Author's Name Yoshifumi NISHIO
2nd Author's Affiliation Department of Electrical and Electronic Engineering, Tokushima University
Date 2006-03-20
Paper # NLP2005-148
Volume (vol) vol.105
Number (no) 675
Page pp.pp.-
#Pages 4
Date of Issue