Path-relinking with tabu search for the capacitated centered clustering problem
作者：
Highlights：
• The CCCP is a new class of NP-Hard problem with high-quality research evolved.
• A framework of classical metaheuristic was composed to solve CCCP instances.
• Our methodology outperforms the best results obtained from the literature.
• We show its robustness by an exhaustive performance evaluation.
• We introduce Score-Table to compare methods and use it to show the superiority.
摘要
•The CCCP is a new class of NP-Hard problem with high-quality research evolved.•A framework of classical metaheuristic was composed to solve CCCP instances.•Our methodology outperforms the best results obtained from the literature.•We show its robustness by an exhaustive performance evaluation.•We introduce Score-Table to compare methods and use it to show the superiority.
论文关键词：Metaheuristics,Clustering,Min-sum-square clustering,CCCP
论文评审过程：Received 27 February 2020, Revised 25 February 2022, Accepted 25 February 2022, Available online 11 March 2022, Version of Record 25 March 2022.
论文官网地址：https://doi.org/10.1016/j.eswa.2022.116766
