TY - GEN

T1 - A Tabu Search Matheuristic for the Generalized Quadratic Assignment Problem

AU - Greistorfer, Peter

AU - Stanek, Rostislav

AU - Maniezzo, Vittorio

PY - 2023/2/23

Y1 - 2023/2/23

N2 - This work treats the so-called Generalized Quadratic Assignment Problem. Solution methods are based on heuristic and partially LP-optimizing ideas. Base constructive results stem from a simple 1-pass heuristic and a tree-based branch-and-bound type approach. Then we use a combination of Tabu Search and Linear Programming for the improving phase. Hence, the overall approach constitutes a type of mat- and metaheuristic algorithm. We evaluate the different algorithmic designs and report computational results for a number of data sets, instances from literature as well as own ones. The overall algorithmic performance gives rise to the assumption that the existing framework is promising and worth to be examined in greater detail.

AB - This work treats the so-called Generalized Quadratic Assignment Problem. Solution methods are based on heuristic and partially LP-optimizing ideas. Base constructive results stem from a simple 1-pass heuristic and a tree-based branch-and-bound type approach. Then we use a combination of Tabu Search and Linear Programming for the improving phase. Hence, the overall approach constitutes a type of mat- and metaheuristic algorithm. We evaluate the different algorithmic designs and report computational results for a number of data sets, instances from literature as well as own ones. The overall algorithmic performance gives rise to the assumption that the existing framework is promising and worth to be examined in greater detail.

KW - Generalized Quadratic Assignment

KW - Matheuristic

KW - Metaheuristic

KW - Linear Programming

KW - Tabu Search

UR - https://link.springer.com/book/10.1007/978-3-031-26504-4

M3 - Conference contribution

SN - 0302-9743

VL - 13838

T3 - Lecture Notes in Computer Science

SP - 544

EP - 553

BT - Metaheuristics

ER -