Vliet, W. van (2009) Heuristics for the Quadratic Assignment Problem. Bachelor's Thesis, Mathematics.

Text
Willemieke_van_Vliet_WB_2009.pdf  Published Version Download (323kB)  Preview 
Abstract
The quadratic assignment problem we can see as a facility location problem. Assume we have n facilities and n locations. We know the flows between each pair of facilities and the distances between each pair of locations. To each location we want to assign a facility such that the distance times the ow is minimized. The quadratic assignment problem is an NPhard optimization problem. This means that there is no algorithm that can solve this problem in polynomial time. Heuristics are algorithms which try to find the optimal solution or a solution that is close to the optimal solution. There are a lot heuristics for the quadratic assignment problem and in my thesis I discuss a few of them. Further I compare a new heuristic of Zvi Drezner with another heuristic, tabu search.
Item Type:  Thesis (Bachelor's Thesis) 

Supervisor name:  D¨ur, Mirjam 
Degree programme:  Mathematics 
Thesis type:  Bachelor's Thesis 
Language:  English 
Date Deposited:  15 Feb 2018 07:28 
Last Modified:  18 Apr 2019 12:16 
URI:  https://fse.studenttheses.ub.rug.nl/id/eprint/8555 
Actions (login required)
View Item 