Summary
International Symposium on Nonlinear Theory and Its Applications
2015
Session Number:B3L-E
Session:
Number:B3L-E-1
A Chaotic Search with Small Memory Consumption for Solving QAP
Hikaru Ohnishi, Yutaka Shimada, Kantaro Fujiwara, Tohru Ikeguchi,
pp.610-613
Publication Date:2015/12/1
Online ISSN:2188-5079
Summary:
Quadratic assignment problem (QAP) is a typical example of NP-hard problems. Therefore, we need to develop algorithms for finding good approximate solutions in a reasonable time frame. In this paper, we proposed a new algorithm that controls execution of the 2-exchange method, which is one of the heuristic algorithms for solving QAPs by chaotic dynamics. In the proposed algorithm, we modified the assignment of neurons and proposed a parameter tuning method for connection weights. As a result, our algorithm can find not only good solutions but also reduce the memory consumption.