merged

Tabu List Size Setting of Tabu Search for the
Quadratic Assignment Problem
Iffah Syazaliyana Binti Mohd Sari
Supervisor: Dr. Mohamed Saifullah Bin Hussin
Bachelor of Science (Financial Mathematics)
School of Informatics and Applied Mathematics
Tabu Search (TS) is used widely to solve combinatorial optimization problem such as the
Quadratic Assignment Problem (QAP). However, there is still a room for improvement in
TS. Tabu list size is one of the important elements in TS that can be improved by adjusting
its size to achieve the maximum performance. However, the size of tabu list varies
depends on the size of problem used. In this paper, we will discuss how the previous
studies set up the suitable tabu list size to tackle QAP and a new strategy of setting tabu
list size is proposed. The size change of tabu list for every predetermined number of
iteration will be our main focus as it can influence the performance of TS. Even though
there is a drawback for this research, the new proposal is expected to be more effective
for solving QAP.
807 | UMT UNDERGRADUATE RESEARCH DAY 2018