.png){kind=icon}
返回
A hybrid algorithmic model for the minimum weight dominating set problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.simpat.2015.11.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Iterated greedy algorithms belong to the class of stochastic local search methods. They are based on the simple and effective principle of generating a sequence of solutions by iterating over a constructive greedy heuristic using destruction and construction phases. This paper, first, presents an efficient randomized iterated greedy approach for the minimum weight dominating set problem, where-given a vertex-weighted graph-the goal is to identify a subset of the graphs' vertices with minimum total weight such that each vertex of the graph is either in the subset or has a neighbor in the subset. Our proposed approach works on a population of solutions rather than on a single one. Moreover, it is based on a fast randomized construction procedure making use of two different greedy heuristics. Secondly, we present a hybrid algorithmic model in which the proposed iterated greedy algorithm is combined with the mathematical programming solver CPLEX. In particular, we improve the best solution provided by the iterated greedy algorithm with the solution polishing feature of CPLEX. The simulation results obtained on a widely used set of benchmark instances shows that our proposed algorithms outperform current state-of-the-art approaches. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Iterated greedy algorithm
Minimum weight dominating set problem
Hybrid model
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
2.6K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
A population-based iterated greedy algorithm for the minimum weight vertex cover problem基于种群的迭代贪心算法求解最小权顶点覆盖问题
PREAI
分享收藏A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
PREAI
分享收藏A population-based iterated greedy algorithm for the delimitation and zoning of rural settlements
OAAI
OAAI分享收藏
没有更多内容
没有更多内容