Tabu search for large location–allocation problems

Recently it has been demonstrated that the use of simulated annealing is a good alternative for solving the minisum location–allocation problem with rectilinear distances compared with other popular methods. In this study it is shown that the same solution quality and a great saving of computational time can be achieved by using tabu search. It is also possible to transfer this method to location–allocation problems with euclidean distances.