In this paper we propose a Variable neighborhood descent based heuristic for the capacitated clustering problem and related handover minimization problem. The performance of the proposed approach is assessed on benchmark instances from the literature. The obtained results confirm that of our approach is highly competitive with the state of-the-art methods, significantly outperforming all of them on the set of randomly-generated instances tested.
CITATION STYLE
Brimberg, J., Mladenović, N., Todosijević, R., & Urošević, D. (2016). Variable neighborhood descent for the capacitated clustering problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9869 LNCS, pp. 336–349). Springer Verlag. https://doi.org/10.1007/978-3-319-44914-2_27
Mendeley helps you to discover research relevant for your work.