Exponential chaotic tabu search hardware for quadratic assignment problems using switched-current chaotic neuron IC

Satoshi Matsui, Yukihiro Kobayashi, Kentaro Watanabe, Yoshihiko Horio

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)

Abstract

The quadratic assignment problem (QAP) is one of the nondeterministic polynominal (NP)-hard combinatorial optimization problems. One of the heuristic algorithms for the QAP is the tabu-search. The exponential tabu-search has been implemented on a neural network, and further it has been extended to be driven by chaotic dynamics based on a chaotic neural network for efficient search. Moreover, chaotic dynamics has also been exploited to avoid the local minima problem. We propose a chaos driven tabu-search neural network hardware system with switched-current chaotic neuron ICs. We build a mixed analog/digital system for the size-10 QAP.

Original languageEnglish
Title of host publication2004 IEEE International Joint Conference on Neural Networks - Proceedings
Pages2221-2225
Number of pages5
DOIs
Publication statusPublished - 2004
Event2004 IEEE International Joint Conference on Neural Networks - Proceedings - Budapest, Hungary
Duration: 2004 Jul 252004 Jul 29

Publication series

NameIEEE International Conference on Neural Networks - Conference Proceedings
Volume3
ISSN (Print)1098-7576

Conference

Conference2004 IEEE International Joint Conference on Neural Networks - Proceedings
Country/TerritoryHungary
CityBudapest
Period04/7/2504/7/29

Fingerprint

Dive into the research topics of 'Exponential chaotic tabu search hardware for quadratic assignment problems using switched-current chaotic neuron IC'. Together they form a unique fingerprint.

Cite this