arrow
返回

An evolutionary algorithm with guided mutation for the maximum clique problem

delete2005-04-01
delete179
PRE
AI
Q
Qingfu Zhang
J
Jianyong Sun
E
Edward Tsang
DOI:10.1109/TEVC.2004.840835delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Estimation of distribution algorithms sample new solutions (offspring) from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The location information of solutions found so far (i.e., the actual positions of these solutions in the search space) is not directly used for generating offspring in most existing estimation of distribution algorithms. This paper introduces a new operator, called guided mutation. Guided mutation generates offspring through combination of global statistical information and the location information of solutions found so far. An evolutionary algorithm with guided mutation (EA/G) for the maximum clique problem is proposed in this paper. Besides guided mutation, EA/G adopts a strategy for searching different search areas in different search phases. Marchiori's heuristic is applied to each new solution to produce a maximal clique in EA/G. Experimental results show that EA/G outperforms the heuristic genetic algorithm of Marchiori (the best evolutionary algorithm reported so far) and a MIMIC algorithm on DIMACS benchmark graphs.
Keyword:
estimation of distribution algorithms
evolutionary algorithm
guided mutation
heuristics
hybrid genetic algorithm
maximum clique problem (MCP)

期刊

IEEE Transactions on Evolutionary Computation 封面图
IEEE Transactions on Evolutionary Computation
IF:
12
论文数:
1.8K
被引数:
2.4W

机构

暂无机构信息
引用论文

引用论文

High-Quality Genome Resource of the Pathogen of Botryosphaeria dothidea Causing Kiwifruit Soft Rot
err2021-04-01
err0
errOAAI
errKuan Liang; Jianbin Lan; Baoquan Wang; Yuanyuan Liu; Qi Lu; Pu Liu
err分享
err收藏
err分享
err收藏
Safety and efficacy of Implanon™, a single-rod implantable contraceptive containing etonogestrel
err2005-05-01
err0
PREAI
errSidney Funk; Michael M. Miller; Daniel R. Mishell; David F. Archer; Alfred Poindexter; Juergen Schmidt; Edio Zampaglione
err分享
err收藏
学者 查看更多内容