Bachelor projects AI (RUG)
Bachelor Project with Dr. Marco Wiering
Solving the Quadratic Assignment Problem.
There are many dfferent combinatorial optimization problems that are
useful for modelling real-world problems found in for example
logistics and transport. The Quadratic Assignment Problem (QAP) is
a well known instance of NP-hard problems, for which optimization
algorithms need to be used to return a good solution in reasonable time.
Recently, we have developed our own QAP solver, called the bandit-inspired
memetic algorithm (BIMA). We have compared this method to two other
methods, and the results were very favorable for BIMA, see:
F. Puglierin, M.M. Drugan and M.A. Wiering. Bandit-Inspired Memetic Algorithms for Solving Quadratic Assignment Problems. Proceedings of IEEE International Conference on Evolutionary Computation (CEC'13), Cancun Mexico, 2013.
In this project it is the goal to found out from literature which
optimization methods are the best for solving QAPs, and to find/change
software to compare a number of the best methods to our own BIMA method.
In this project you will learn about optimization problems, algorithms such
as memetic algorithms, tabu search, and evolutionary algorithms, and you
will learn which experimental methodologies to use for this field of research.