✦ LIBER ✦

An efficient tabu search procedure for the p-Median Problem

✍ Scribed by Erik Rolland; David A. Schilling; John R. Current

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 944 KB
Volume: 96
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(96)00141-5

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Epcot: An efficient procedure for colori

Epcot: An efficient procedure for coloring optimally with Tabu Search

✍ N. Dubois; D. de Werra 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 707 KB

We present an exact procedure for coloring the nodes of s graph with as few colors as possible. The problem o~ deciding whether an arbitrary graph can be colored with k colars is NP-complete. The procedure is based ms an implicit enumm'&tion technique. At some stsgrs of the algorithm heuristic metho

A new tabu search procedure for an audit

A new tabu search procedure for an audit-scheduling problem

✍ Peter Brucker; Doris Schumacher 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 141 KB 👁 1 views

We consider the following version of the auditing problem. A set of jobs must be processed by auditors A , . . . , A K . Each job consists of several tasks and there may be precedence constraints between these tasks. There is a due date associated with each job. Each auditor is available during disj

A tree search algorithm for the p-median

A tree search algorithm for the p-median problem

✍ N. Christofides; J.E. Beasley 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 659 KB

Parallelization of the scatter search fo

Parallelization of the scatter search for the p-median problem

✍ Félix Garcı́a-López; Belén Melián-Batista; José A Moreno-Pérez; J Marcos Moreno- 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 207 KB

This article develops several strategies for the parallelization of the metaheuristic called scatter search, which is a population-based method that constructs solutions by combining others. Three types of parallelization have been proposed to achieve either an increase of efficiency or an increase

Tabu search for the multilevel generaliz

Tabu search for the multilevel generalized assignment problem

✍ Manuel Laguna; James P. Kelly; JoséLuis González-Velarde; Fred Glover 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 905 KB

A tabu search strategy for an efficient

A tabu search strategy for an efficient solution of linear systems in electromagnetic problems

✍ M. Dionigi; R. Sorrentino; L. Tarricone; A. Esposito 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 2 views

A strategy is proposed to enhance the performance of some numerical methods used in the solution of electromagnetic problems. The strategy can be extended to any numerical method based on the partitioning of the spatial domain into elementary cells. Two different implementations of the strategy are