.png){kind=icon}
返回
An Improved Memetic Algorithm for the Partial Vertex Cover Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2895738.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As a generalized form of the classical minimum vertex cover problem (MVCP), the minimum partial vertex cover problem not only inherits the value of MVCP in both theoretical and practical research but also extends the application scenarios under the current era of big data. In order to solve such a classical NP-hard combinatorial optimization problem, we propose an efficient memetic algorithm called MAPVC, the whose motivation behind the idea is a balance between exploitation and exploration. Specifically, the evolutionary process with a powerful backbone crossover and an adaptive mutation is adopted mainly for skipping the local optimum, and the local search with a three-layer encoding, promotive and inhibitory factor interaction is integrated into the framework to ameliorate the solutions. The experimental results on DIMACS and BHOSLIB benchmarks verify the efficiency of MAPVC through comparisons with an exact solver Gurobi and state-of-the-art local search GRASP-PVC. In addition, we also conduct the experiments on parameters setting and strategies validation to provide a comprehensive analysis of MAPVC.
Keyword:
Adaptive mutation
memetic algorithm
minimum partial vertex cover
powerful backbone crossover
promotive and inhibitory factor interaction
three-layer encoding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏Comparative pharmacokinetics of a proliposome formulation of Ginkgo biloba extract and Ginaton in rats by a sensitive ultra performance liquid chromatography–tandem mass spectrometry method银杏叶提取物前脂质体制剂与Ginaton在 rats 中的比较药代动力学研究：一种敏感的超高效液相色谱-串联质谱法OAAI
OAAI分享收藏An ant colony optimization algorithm for the minimum weight vertex cover problem求解最小权顶点覆盖问题的蚁群优化算法
PREAI
分享收藏
查看更多内容