Path relinking for the vertex separator problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Expert Systems with Applications Année : 2017

Path relinking for the vertex separator problem

Résumé

This paper presents the first population-based path relinking algorithm for solving the NP-hard vertex separator problem in graphs. The proposed algorithm employs a dedicated relinking procedure to generate intermediate solutions between an initiating solution and a guiding solution taken from a reference set of elite solutions (population) and uses a fast tabu search procedure to improve some selected intermediate solutions. Special care is taken to ensure the diversity of the reference set. Dedicated data structures based on bucket sorting are employed to ensure a high computational efficiency. The proposed algorithm is assessed on four sets of 365 benchmark instances with up to 20,000 vertices, and shows highly comparative results compared to the state-of-the-art methods in the literature. Specifically, we report improved best solutions (new upper bounds) for 67 instances which can serve as reference values for assessment of other algorithms for the problem.

Fichier non déposé

Dates et versions

hal-01532911 , version 1 (04-06-2017)

Identifiants

Citer

Fuda Ma, Yang Wang, Jin-Kao Hao. Path relinking for the vertex separator problem. Expert Systems with Applications, 2017, 82, pp.332-343. ⟨10.1016/j.eswa.2017.03.064⟩. ⟨hal-01532911⟩

Collections

UNIV-ANGERS LERIA
40 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More