FPGA implementation of tabu search for the quadratic assignment problem

被引：6
|
作者：
Wakabayashi, Shinichi [1 ]
Kimura, Yoshihiro [1 ]
Nagayama, Shinobu [1 ]
机构：
[1] Hiroshima City Univ, Fac Informat Sci, 3-4-1 Ozuka-higashi, Hiroshima 7313194, Japan
来源：
2006 IEEE INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE TECHNOLOGY, PROCEEDINGS | 2006年
基金：
日本学术振兴会;
关键词：
D O I：
10.1109/FPT.2006.270325
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we propose an FPGA implementation of tabu search to solve the quadratic assignment problem in a short execution time. In the proposed hardware implementation of tabu search, multiple neighbor solutions are evaluated in parallel and each solution is evaluated in a pipeline fashion. The proposed method effectively utilizes internal block RAMs of recent large scale FPGAs. Experimental results show the efficiency and effectiveness of the proposed method.
引用
收藏
页码：269 / +
页数：2
相关论文
共 50 条
12345