.png){kind=icon}
返回
An improved hybrid algorithm for the set covering problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2015.04.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The state-of-the-art ant colony optimization (ACO) algorithm to solve large scale set covering problems (SCP) starts by solving the Lagrangian dual (LD) problem of the SCP to obtain quasi-optimal dual values. These values are then exploited by the ACO algorithm in the form of heuristic estimates. This article starts by discussing the complexity of this approach where a number of new parameters are introduced to escape local optimums and normalize the heuristic values. To avoid these complexities, we propose a new hybrid algorithm that starts by solving the linear programming (LP) relaxation of the SCP. This solution is used to eliminate unnecessary columns, and to estimate the heuristic information. To generate solutions, we use a Max-Min Ant System (MMAS) algorithm that employs a novel mechanism to update the pheromone trail limits to maintain a predetermined exploration rate. Computational experiments on different sets of benchmark instances prove that our proposed algorithm can be considered the new state-of-the-art meta-heuristic to solve the SCP. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Linear programming
Lagrangian relaxation
Max-min ant system
Ant colony optimization
Set covering problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
The nose has it: Opportunities and challenges for intranasal drug administration for neurologic conditions including seizure clusters鼻子有它: 包括癫痫发作群在内的神经系统疾病的鼻内给药的机遇和挑战
OAAI
.png){kind=icon}
OAAI分享收藏分享收藏A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems一种变形程序，用于补充与成本和覆盖率相关的集合覆盖问题的模拟退火启发式方法
PREAI
分享收藏
查看更多内容