An efficient tabu search procedure for the p-Median Problem |
| |
| Institution: | 1. Florida Atlantic University, Boca Raton, Fleming Hall (FL-24), United States;2. Universitat de València, Departamento de Dirección de Empresas, Avenida Tarongers, S/N, 46022 Valencia, Spain;3. ESIC Business and Marketing School, Av. de Blasco Ibáñez, 55, 46021 València, Spain;1. Pablo de Olavide University, Ctra. de Utrera km 1., Sevilla 41013, Spain;2. Rey Juan Carlos University, Tulipán s/n., Móstoles, Madrid 28933, Spain |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
