@inproceedings{OKANO-GEEC-2018,
title = {A local search based on variant variable depth search for the quadratic assignment problem},
author = {Takeshi Okano and Kengo Katayama and Kazuho Kanahara and Noritaka Nishihara},
doi = {10.1109/GCCE.2018.8574497},
year = {2018},
date = {2018-10-09},
urldate = {2018-10-09},
booktitle = {GEEC-2018: 2018 IEEE 7th Global Conference on Consumer Electronics},
pages = {60-63},
abstract = {The quadratic assignment problem (QAP) has practical applications in the electronics domain, such as component placing on circuit boards, minimizing the number of transistors on integrated circuits, optimal placing of letters on touchscreen devices, etc. Since QAP is NP-hard and large problems are not practically solvable to optimality, heuristic methods such as local search are regarded as an efficient algorithm to obtain near optimal solutions within a reasonable time. In this paper, we present a new sophisticated local search algorithm, called variant k-opt local search (vKLS), based on a variant of the variable depth search for QAP. Computational results show that vKLS is capable of finding better solutions on average than the standard VDS and typical 2-opt local search algorithms.},
keywords = {Quadratic assignment problem, Variable depth search},
pubstate = {published},
tppubtype = {inproceedings}
}
