Heuristic concentration and Tabu search: A head to head comparison

Abstract

Earlier this year two papers applying the metaheuristics Tabu search (TS) and Heuristic concentration (HC) to the p-median problem were published in consecutive volumes of this journal. Here we apply the method of HC to some of the data sets which were used for computational experience in the paper on TS. For these examples, which we regard as being of a particularly challenging character, HC discovers the superior solution (superior to TS) in about 95% of the cases, and, where the optimal solution is known, the optimal solution in about 80% of the cases. No general conclusion on the relative times for the two approaches can be drawn.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 60 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.