Path relinking for the vertex separator problem.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 122841274 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Path relinking for the vertex separator problem. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Ma%2C+Fuda%22">Ma, Fuda</searchLink><relatesTo>1</relatesTo><i> ma@info.univ-angers.fr</i><br /><searchLink fieldCode="AR" term="%22Wang%2C+Yang%22">Wang, Yang</searchLink><relatesTo>2</relatesTo><i> yangw@nwpu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Hao%2C+Jin-Kao%22">Hao, Jin-Kao</searchLink><relatesTo>1,3</relatesTo><i> jin-kao.hao@univ-angers.fr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Expert+Systems+with+Applications%22">Expert Systems with Applications</searchLink>. Oct2017, Vol. 82, p332-343. 12p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Path+analysis+%28Statistics%29%22">Path analysis (Statistics)</searchLink><br /><searchLink fieldCode="DE" term="%22Geometric+vertices%22">Geometric vertices</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+solving%22">Problem solving</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=122841274 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.eswa.2017.03.064 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 332 Subjects: – SubjectFull: Algorithms Type: general – SubjectFull: Path analysis (Statistics) Type: general – SubjectFull: Geometric vertices Type: general – SubjectFull: Problem solving Type: general – SubjectFull: Graph theory Type: general – SubjectFull: Computational complexity Type: general Titles: – TitleFull: Path relinking for the vertex separator problem. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ma, Fuda – PersonEntity: Name: NameFull: Wang, Yang – PersonEntity: Name: NameFull: Hao, Jin-Kao IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: Oct2017 Type: published Y: 2017 Identifiers: – Type: issn-print Value: 09574174 Numbering: – Type: volume Value: 82 Titles: – TitleFull: Expert Systems with Applications Type: main |
| ResultId | 1 |
