Iterated variable neighborhood search for the capacitated clustering problem - Université d'Angers Accéder directement au contenu
Article Dans Une Revue Engineering Applications of Artificial Intelligence Année : 2016

Iterated variable neighborhood search for the capacitated clustering problem

Résumé

The NP-hard capacitated clustering problem (CCP) is a general model with a number of relevant applications. This paper proposes a highly effective iterated variable neighborhood search (IVNS) algorithm for solving the problem. IVNS combines an extended variable neighborhood descent method and a randomized shake procedure to explore effectively the search space. The computational results obtained on three sets of 133 benchmarks reveal that the proposed algorithm competes favorably with the state-of-the-art algorithms in the literature both in terms of solution quality and computational efficiency. In particular, IVNS discovers an improved best known result (new lower bounds) for 28 out of 83 most popular instances, while matching the current best known results for the remaining 55 instances. Several essential components of the proposed algorithm are investigated to understand their impacts on the performance of algorithm.

Fichier principal
Vignette du fichier
laihaoeaai2017.pdf (223 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01412523 , version 1 (08-12-2016)
hal-01412523 , version 2 (04-06-2017)

Identifiants

Citer

Xiangjing Lai, Jin-Kao Hao. Iterated variable neighborhood search for the capacitated clustering problem. Engineering Applications of Artificial Intelligence, 2016, 56, pp.102-120. ⟨10.1016/j.engappai.2016.08.004⟩. ⟨hal-01412523v2⟩

Collections

UNIV-ANGERS LERIA
75 Consultations
174 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More