Abstract
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ohlemüller, M. Tabu search for large location–allocation problems. J Oper Res Soc 48, 745–750 (1997). https://doi.org/10.1057/palgrave.jors.2600409
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2600409