New Hybrid Genetic Algorithm for Vertex Cover Problems

被引：0

作者：

Huo Hongwei Xu Jin School of Computer Science Xidian University Xian P R China Department of Control Science and Engineering Huazhong University ofScience and Technology Wuhan P R China ^{[1
,710071
,2
,430074
]}

机构：

来源：

Journal of Systems Engineering and Electronics | 2003年 / 04期

关键词：

vertex cover; hybrid genetic algorithm; scan-repair; local improvement;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

<正> This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are used to perform global exploration in a population, while neighborhood search methods are used to perform local exploitation around the chromosomes. The experimental results indicate that hybrid genetic algorithms can obtain solutions of excellent quality to the problem instances with different sizes. The pure genetic algorithms are outperformed by the neighborhood search heuristics procedures combined with genetic algorithms.

引用

页码：90 / 94

页数：5