This algorithm is due to Lin and Kernighan [41] and share some of the search strategies with aforementioned Tabu search technique. For example, the LK method uses uses lists that are very similar to the tabu lists but in a way that is a bit more complicated than explained above. At each iteration of the iterative process, LK decides how many edges to exchange producing generally high quality solutions at the expense of using significant amounts of computational time in comparison with other edge exchange algorithms.