This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aiding the solution process for optimisation problems. The central methodologies of the technique are filtering solutions from the search space and reducing the level of problem detail to be considered at each level of the solution process. The first multilevel algorithm uses a simple tabu search while the other executes a standard local search procedure. Both algorithms demonstrate that the multilevel technique is capable of aiding the solution process for this combinatorial optimisation problem.
CITATION STYLE
Rodney, D., Soper, A., & Walshaw, C. (2008). Multilevel approaches applied to the capacitated clustering problem. In Proceedings of the 2008 International Conference on Scientific Computing, CSC 2008 (pp. 271–277).
Mendeley helps you to discover research relevant for your work.