13.05.2018 Views

merged

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

A Study on Improved 2-Exchange of Tabu Search for<br />

the Quadratic Assignment Problem<br />

Muhammad Syamil Bin Naseh<br />

Supervisor: Dr. Mohamed Saifullah Bin Hussin<br />

Bachelor of Science (Financial Mathematics)<br />

School of Informatics and Applied Mathematics<br />

Quadratic Assignment Problem (QAP) is a typical combinatorial optimization problem.<br />

Various methods can be used in solving QAP such as Tabu Search (TS), Simulated<br />

Annealing, Genetic Algorithms and many others . The part that we will look upon in<br />

solving the QAP is to improve the TS of 2-exchange procedure. It is said that the 2-<br />

exchange is very time consuming and not too efficient in achieving the global optimum<br />

value. 2-exchange act as the movement in finding best swaps or pairs of edges in the<br />

assignment problem to minimize the tour length of the model. In this paper, we will<br />

compare and look into discussions from previous studies regarding this matter. The<br />

effectiveness of the implementation is demonstrated with the experiments data from<br />

previous research. Although there is a limit for this research, I am hoping to see the best<br />

performance of the method from the discussion.<br />

832 | UMT UNDERGRADUATE RESEARCH DAY 2018

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!