merged

New Strategy for Obtaining Initial Solution of Tabu Search
for the Quadratic Assignment Problem
Nur Husnina Binti Hashim
Supervisor: Dr. Mohamed Saifullah Bin Hussin
Bachelor of Science (Financial Mathematics)
School of Informatics and Applied Mathematics
Many studies had been done on Tabu Search (TS) for tackling Quadratic Assignment
Problem (QAP). However, the understanding of the interaction between the initial solution
and the performance of the algorithm still have room for further studies. The most
significant objective is to study the existing strategy to construct an initial solution of TS
in tackling QAP. This objective can be achieved by studying several of the existing method
on obtaining the initial solution for QAP, Vehicle Routing Problem (VRP) and Traveling
Salesman Problem (TSP). The second objective of this study is to propose a new strategy
based on the previous study to produce an improved initial solution. By the end of this
project, we expect a better solution can be obtained using the proposed strategy in
generating an initial solution. The idea presented may be used as a significant
contribution for practical implementation.
860 | UMT UNDERGRADUATE RESEARCH DAY 2018