Intensification-driven tabu search for the minimum differential dispersion problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Knowledge-Based Systems Année : 2019

Intensification-driven tabu search for the minimum differential dispersion problem

Résumé

The minimum differential dispersion problem is a NP-hard combinatorial optimization problem with numerous relevant applications. In this paper, we propose an intensification-driven tabu search algorithm for solving this computationally challenging problem by integrating a constrained neighborhood, a solution-based tabu strategy, and an intensified search mechanism to create a search that effectively exploits the elements of intensification and diversification. We demonstrate the competitiveness of the proposed algorithm by presenting improved new best solutions for 127 out of 250 benchmark instances (>50%). We study the search trajectory of the algorithm to shed light on its behavior and investigate the spatial distribution of high-quality solutions in the search space to motivate the design choice of the intensified search mechanism.
Fichier principal
Vignette du fichier
S0950705119300103.pdf (1.71 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02309983 , version 1 (21-10-2021)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Xiangjing Lai, Jin-Kao Hao, Fred Glover, Dong Yue. Intensification-driven tabu search for the minimum differential dispersion problem. Knowledge-Based Systems, 2019, 167, pp.68-86. ⟨10.1016/j.knosys.2019.01.010⟩. ⟨hal-02309983⟩
36 Consultations
22 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More