An Adaptive Intelligent Water Drops Algorithm for Set Covering Problem

2019 19th International Conference on Computational Science and Its Applications (ICCSA)(2019)

引用 6|浏览43
暂无评分
摘要
Today, natural resources are more scarce than ever, so we must make good use of them. To achieve this goal, we can use metaheuristic optimization tools as an alternative to achieve good results in a reasonable amount of time. The present work focuses on the use of adaptive techniques to facilitate the use of this type of tool to obtain good functional parameters. We use a constructive metaheuristic algorithm called Intelligent Water Drops to solve the set covering problem. To demonstrate the efficiency of the proposed method, the obtained results were compared with the standard version using the same initial configuration for both algorithms. Additionally, the Kolmogorov-Smirnov-Lilliefors, Wilcoxon signed-rank and Violin chart tests were applied to statistically validate the results, which showed that metaheuristics with autonomous search have a better behavior than do standard algorithms.
更多
查看译文
关键词
Metaheuristics,Autonomous Search,Combinatorial Optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要