Intensification-driven tabu search for the minimum differential dispersion problem - Archive ouverte HAL Access content directly
Journal Articles Knowledge-Based Systems Year : 2019

Intensification-driven tabu search for the minimum differential dispersion problem

Abstract

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
Origin : Files produced by the author(s)

Dates and versions

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

Licence

Attribution - NonCommercial - CC BY 4.0

Identifiers

Cite

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⟩
25 View
12 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More