.png){kind=icon}
返回
A New Direct Coefficient-Based Heuristic Algorithm for Set Covering Problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s40815-021-01208-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The set covering problem is a fundamental model which comprises a wide range of important applications such as crew scheduling problems that need to cover a set of trips. It is one of the most common issues in the facility location problem, which requires further investigations, particularly in emergency and service facilities. As such, the objective of this study is to propose a new coefficient-based heuristic algorithm for the set covering problems. This paper has accordingly presented the algorithm that evaluates the qualification of subsets by directly applying a fitness function. This fitness function is formulated based on sets and subsets coefficients in a way that the subsets of selected sets have the lowest probability to be selected in the next iteration. The algorithm is not only capable of constructing an answer within polynomial time, but can solve complex set covering problems without conventional restrictions. The performance of this algorithm is evaluated on benchmark instances including a set of reproduced and selected OR-library problems within different sizes. Computational results indicate that the proposed heuristic algorithm produces better solutions, especially in large-scale problems comparing simulated annealing in terms of quality and time.
Keyword:
Set covering problem
Heuristic algorithm
Coefficient
Optimization
期刊
IF:
3.6
论文数:
2.2K
被引数:
4.3K
机构
引用论文
Covering problem on fuzzy graphs and its application in disaster management system.png)
SOFT COMPUTING
OAAI
SOFT COMPUTINGIF2.5
OAAI分享收藏EFFECTS OF CONTINUOUS NEGATIVE PRESSURE ON LUNG MECHANICS IN IDIOPATHIC RESPIRATORY DISTRESS SYNDROMEPediatrics
PediatricsIF0
PREAI
分享收藏Iterated local search with tabu search for the weighted vertex coloring problem带禁忌搜索的加权顶点着色问题的迭代局部搜索OAAI
OAAI分享收藏
查看更多内容