AN EFFICIENT TABU SEARCH PROCEDURE FOR THE P-MEDIAN PROBLEM

Authors
ROLLAND E SCHILLING DA CURRENT JR
Citation
E. Rolland et al., AN EFFICIENT TABU SEARCH PROCEDURE FOR THE P-MEDIAN PROBLEM, European journal of operational research, 96(2), 1997, pp. 329-342
Citations number
34
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
Journal title
European journal of operational research → ACNP
ISSN journal
03772217
Volume
96
Issue
2
Year of publication
1997
Pages
329 - 342
Database
ISI
SICI code
0377-2217(1997)96:2<329:AETSPF>2.0.ZU;2-Y
Abstract
In this paper we present a new solution heuristic for the p-Median Pro blem. The algorithm is based on tabu search principles, and uses short term and long term memory, as well as strategic oscillation and rando m tabu list sizes, Our proposed procedure is compared with two other m ove heuristics: a well-known interchange heuristic and a recent hybrid heuristic. In computational tests on networks ranging in size up to 5 00 nodes the new heuristic is found to be superior with respect to the quality of solutions produced.