For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
An Initial Neighborhood Search Algorithm for Large Scale Quadratic Assignment Problem
Fubito TOYAMA Hiroshi MORI Kenji SHOJI
A - Abstracts of IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (Japanese Edition)
Publication Date: 2020/08/01
Online ISSN: 1881-0195
Type of Manuscript: LETTER
quadratic assignment problem, combinatorial optimization, meta-heuristics,
Full Text(in Japanese): PDF(397.7KB)>>
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.