| Presentation | 2012-04-19 二次割当問題のための同期更新指数減衰カオスタブーサーチにおけるニューロン選択法のハードウェア実装に向けた改良 Akihito TOYODA, Yosihiko HORIO, Kazuyuki AIHARA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | To solve quadratic assignment problems (QAPs), a chaotic tabu search, in which a tabu search is driven by chaotic neuro-dynamics, was proposed. To adopt the chaotic tabu search in a parallel processing hardware system, several modifications, e.g., synchronous updating of the neuron states, were introduced. In such a synchronous updating scheme, all the neuronal states in a chaotic neural network are updated at once. In the chaotic tabu search, a 2-opt exchange is carried out according to the firing of a single neuron. By the synchronous update, however, a plural number of neurons may fire, which prevents to uniquely determine the target of the 2-opt exchange. To overcome this problem, several "neuron selection methods" have been proposed to select one neuron among all the fired neurons. Neurons are sorted according to the values of their internal states in these neuron selection algorithms. However, it would be difficult in a hardware system to sense the analog values of internal states of all neurons, and to sort them in a quick manner. As a result, an advantage of the parallel processing with hardware will be deteriorated. Therefore, in this paper, a novel neuron selection method which does not rely on the sorting of the neuronal states. In the proposed method, a fixed number of neurons are randomly selected among those with their internal state values exceeding a certain threshold value. Numerical simulations confirm the validity of the proposed method by comparing its solving performances for QAPs, such as an arrival rate for the optimal solution, an average error from the optimal, and time evolutions of solutions, to one of the previously proposed neuron selection method and robust tabu search algorithm. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | combinatorial optimization problem / quadratic assignment problem / chaotic taboo search / chaos neural network |
| Paper # | NLP2012-3 |
| Date of Issue |
| Conference Information | |
| Committee | NLP |
|---|---|
| Conference Date | 2012/4/12(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) | |
| Sub Title (in English) | |
| Keyword(1) | combinatorial optimization problem |
| Keyword(2) | quadratic assignment problem |
| Keyword(3) | chaotic taboo search |
| Keyword(4) | chaos neural network |
| 1st Author's Name | Akihito TOYODA |
| 1st Author's Affiliation | Faculty of Engineering, Tokyo Denki University() |
| 2nd Author's Name | Yosihiko HORIO |
| 2nd Author's Affiliation | Faculty of Engineering, Tokyo Denki University |
| 3rd Author's Name | Kazuyuki AIHARA |
| 3rd Author's Affiliation | Institute of Industrial Science, The University of Tokyo |
| Date | 2012-04-19 |
| Paper # | NLP2012-3 |
| Volume (vol) | vol.112 |
| Number (no) | 6 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |