Variable Neighborhood Descent for the Capacitated Clustering Problem - Université Polytechnique des Hauts-de-France Access content directly
Book Sections Year : 2016

Variable Neighborhood Descent for the Capacitated Clustering Problem

Abstract

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

Domains

Automatic
Not file

Dates and versions

hal-03667207 , version 1 (13-05-2022)

Identifiers

Cite

Jack Brimberg, Nenad Mladenovic, Raca Todosijević, Dragan Urošević. Variable Neighborhood Descent for the Capacitated Clustering Problem. Discrete Optimization and Operations Research, 9869, Springer International Publishing, pp.336-349, 2016, Lecture Notes in Computer Science, 978-331944913-5. ⟨10.1007/978-3-319-44914-2_27⟩. ⟨hal-03667207⟩
3 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More