Heuristic Concentration (HC) is a metaheuristic for the solution of combinatorial problems. In stage one a Concentration Set (CS) is developed by multiple runs of an interchange heuristic. The CS is effective when it is small but comprehensive. Both of these characteristics depend upon: 1). the quality of the heuristic; 2). the number of times it is run (q); and 3). the number of “best” solutions used to create the CS (m). Stage two involves the construction of an improved, and at least potentially optimal, solution. Proper values for the parameters M and Q increase the probability of selecting correct elements to construct the optimal solution in stage two and decrease the work in its development. After a consideration of the robustness of two alternative interchange heuristics this paper concentrates on the appropriate values for the parameters m and q. The p-median problem is used in this study.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.