M. Fatih TasgetirenQuan-Ke PanYucel OzturkogluOzlem Koctas CoturCotur, Ozlem KoctasTasgetiren, M. FatihPan, Quan-KeOzturkoglu, Yucel2025-10-062017978-1-5090-4601-0978150904601010.1109/CEC.2017.79695152-s2.0-85028518265https://gcris.yasar.edu.tr/handle/123456789/6747https://doi.org/10.1109/CEC.2017.7969515The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making block moves in a given solution. As a local search in this paper the VNST is employed from the literature to be applied to a solution obtained after several block moves. Besides the single-solution based VBIH we also propose a populated VBIH (PVBIH) in this paper. The proposed algorithms were evaluated on quadratic assignment problem instances arising from real life problems as well as on a number of benchmark instances from the QAPLIB. The computational results show that the proposed algorithms are very effective in solving both types of instances. All PCB instances are further improved.Englishinfo:eu-repo/semantics/closedAccessquadratic assignment problem, variable block insertion heuristic, variable neighborhood searchTOTAL WEIGHTED TARDINESS, ITERATED LOCAL SEARCH, DEPENDENT SETUP TIMES, SINGLE-MACHINE, NEIGHBORHOOD SEARCH, GENETIC ALGORITHM, OPTIMIZATION, MINIMIZATION, LOCATION, HYBRIDQuadratic Assignment ProblemVariable Neighborhood SearchVariable Block Insertion HeuristicConference Object