Article ID: | iaor20002648 |
Country: | Netherlands |
Volume: | 117 |
Issue: | 3 |
Start Page Number: | 522 |
End Page Number: | 532 |
Publication Date: | Sep 1999 |
Journal: | European Journal of Operational Research |
Authors: | Rosing K.E., Schilling D.A., ReVelle C.S. |
Keywords: | heuristics |
Heuristics concentration (HC) is a two-stage metaheuristic that can be applied to a wide variety of combinatorial problems. It is particularly suited to location problems in which the number of facilities is given in advance. In such settings, the first stage of HC repeatedly applies some random-start interchange (or other) heuristic to produce a number of alternative facility configurations. A subset of the best of these alternatives is collected and the union of the facility sites in them is called a concentration set (CS). Among the component elements of the CS are likely to be included those sites which are members of the optimal solution. In earlier studies the second stage of HC has consisted of an exact procedure to extract the best possible solution from the CS. In this paper we demonstrate, for the