首页> 外文会议>Iberian Conference on Information Systems andechnologies >The set covering problem solved by the Black Hole Algorithm
【24h】

The set covering problem solved by the Black Hole Algorithm

机译:黑洞算法解决的集合涵盖问题

获取原文

摘要

The Set Covering Problem is a classical problem in combinatorial optimization that belongs to the Karp's 21 NP-hard problems, with many practical applications. In this paper, an approach based on Black Hole Algorithm is proposed to solve this problem. The black hole algorithm is a metaheuristic that is inspired by nature, especially by the black hole phenomenon in space. To improve the performance of metaheuristics are used repairing operator, which those solutions that violate the constraints, preprocessing accelerate the resolution of the problem, and transfer function and discretization function to adapts the solutions to a binary domains. We report interesting and competitive experimental results on a set of 45 instances preprocessed the Set Covering Problem.
机译:集合涵盖问题是组合优化中的经典问题,属于Karp的21个NP硬问题,具有许多实际应用。本文提出了一种基于黑洞算法的方法来解决这个问题。黑洞算法是一种由大自然启发的成交感器,尤其是空间中的黑洞现象。为了提高成式化的性能,使用修复操作员,这些解决方案违反约束的解决方案,预处理加速了问题的解决,传递函数和离散化功能将解决方案适应二进制域。我们报告了一些45个实例的有趣和竞争性的实验结果,预处理了集合覆盖问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号