An Initial Neighborhood Search Algorithm for Large Scale Quadratic Assignment Problem

Fubito TOYAMA  Hiroshi MORI  Kenji SHOJI  

Publication
A - Abstracts of IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (Japanese Edition)   Vol.J103-A   No.8   pp.196-199
Publication Date: 2020/08/01
Online ISSN: 1881-0195
DOI: 
Type of Manuscript: LETTER
Category: 
Keyword: 
quadratic assignment problem,  combinatorial optimization,  meta-heuristics,  

Full Text(in Japanese): PDF(397.7KB)>>
Buy this Article




Summary: 
Many metaheuristics have been proposed for QAP. To evaluate the performance of these algrotihms, benchmark problems are used. But these problems do not have large scale instances. Thus, these metaheuristics have been only applied to small scale problems. In this paper, we propose an initial neighborhood search algorimthm for large scale QAP.