Travelling salesman problem for the advanced algorithms course at KTH