|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Variable neighborhood descent for the capacitated clustering problem||Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||Volume:||9869 LNCS||First page:||336||Last page:||349||Conference:||9th International Conference on Discrete Optimization and Operations Research, DOOR 2016; Vladivostok; Russian Federation; 19 September 2016 through 23 September 2016||Issue Date:||1-Jan-2016||Rank:||M33||ISBN:||978-3-319-44913-5||ISSN:||0302-9743||DOI:||10.1007/978-3-319-44914-2_27||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.
|Keywords:||Clustering | Heuristic | Optimization | Variable neighborhood descent||Publisher:||Springer Link|
Show full item record
checked on Apr 15, 2021
checked on Apr 16, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.