| Article ID: | iaor19991096 |
| Country: | Netherlands |
| Volume: | 96 |
| Issue: | 2 |
| Start Page Number: | 329 |
| End Page Number: | 342 |
| Publication Date: | Jan 1997 |
| Journal: | European Journal of Operational Research |
| Authors: | Current John R., Schilling David A., Rolland Erik |
| Keywords: | tabu search, -centre problem |
In this paper we present a new solution heuristic for the p-Median Problem. The algorithm is based on tabu search principles, and uses short term and long term memory, as well as strategic oscillation and random tabu list sizes. Our proposed procedure is compared with two other move heuristics: a well-known interchange heuristic and a recent hybrid heuristic. In computational tests on networks ranging in size up to 500 nodes the new heuristic is found to be superior with respect to the quality of solutions produced.