Bibliographic Details
| Title: |
Path relinking for the vertex separator problem. |
| Authors: |
Ma, Fuda1 ma@info.univ-angers.fr, Wang, Yang2 yangw@nwpu.edu.cn, Hao, Jin-Kao1,3 jin-kao.hao@univ-angers.fr |
| Source: |
Expert Systems with Applications. Oct2017, Vol. 82, p332-343. 12p. |
| Subjects: |
Algorithms, Path analysis (Statistics), Geometric vertices, Problem solving, Graph theory, Computational complexity |
| Abstract: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Expert Systems with Applications is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |