merged

New Tabu Tenure Setting Strategy of Tabu Search for
Solving Quadratic Assignment Problem
Ahmad Muizzuddin Bin Mohd Rahim
Supervisor: Dr. Mohamed Saifullah Bin Hussin
Bachelor of Science (Financial Mathematics)
School of Informatics and Applied Mathematics
Various studies have been conducted using Tabu Search (TS) for solving difficult
optimization problems, for example, the Quadratic Assignment Problem (QAP), an NPhard
combinatorial optimization problem that appears in many practical applications.
Several procedures have been identified in TS that affect its performance on the QAP,
such as the local search used, tabu list size and tabu tenure. Tabu tenure is one of the
parameter that greatly affects the performance of TS. The objective of this research is to
propose new tabu tenure setting strategy to improve the performance of TS for solving
the QAP. This objective can be accomplished by studying existing tabu tenure setting
strategy of TS when solving the QAP.
787 | UMT UNDERGRADUATE RESEARCH DAY 2018