A modified algorithm for the quadratic assignment problem using chaotic-neuro-dynamics for VLSI implementation

K. Tanaka, Y. Horio, K. Aihara

Research output: Contribution to conferencePaperpeer-review

5 Citations (Scopus)

Abstract

The quadratic assignment problem (QAP) is one of the NP-hard combinatorial optimization problems, which is very difficult to solve [1]. The tabu search technique, one of the various heuristic methods for the QAP, has been implemented in a neural network form with chaotic dynamics [2]-[4]. In order to achieve a high-speed massively parallel solution of the QAP, a mixed analog/digital integrated circuit implementation of the system is mandatory. However, the algorithm in [4] cannot be implemented with IC technology as it is. Therefore, the algorithm in [4] is modified to be suitable for the analog IC implementation in this paper. The performance of the modified algorithm is investigated with numerical simulations. The circuit characteristics obtained from a prototype chip is extensively used in the simulations.

Original languageEnglish
Pages240-245
Number of pages6
Publication statusPublished - 2001 Jan 1
Externally publishedYes
EventInternational Joint Conference on Neural Networks (IJCNN'01) - Washington, DC, United States
Duration: 2001 Jul 152001 Jul 19

Other

OtherInternational Joint Conference on Neural Networks (IJCNN'01)
CountryUnited States
CityWashington, DC
Period01/7/1501/7/19

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A modified algorithm for the quadratic assignment problem using chaotic-neuro-dynamics for VLSI implementation'. Together they form a unique fingerprint.

Cite this