【24h】

Constructive Metaheuristics for the Set Covering Problem

机译:集合覆盖问题的建设性化培育体

获取原文
获取外文期刊封面目录资料

摘要

Different criteria exist for the classification of the metaheuristics. One important classification is: improvement metaheuristics and constructive. On the one hand improvement metaheuristics, begins with an initial solution and iteratively improves the quality of the solution using neighborhood search. On the other hand, constructive metaheuristics, are those in which a solution is built from the beginning, finding in each iteration a local optimum. In this article, we to compare two constructive metaheuristics, Ant Colony Optimization and Intelligent Water Drops, by solving a classical NP-hard problem, such like the Set Covering Problem, which has many practical applications, including line balancing production, service installation and crew scheduling in railway, among others. The results reveal that Ant Colony Optimization has a better behavior than Intelligent Water Drops in relation to the problem considered.
机译:在甲醚分类中存在不同的标准。一个重要的分类是:改善的核心学和建设性。在一方面改进的成分中,从初始解决方案开始,使用邻域搜索迭代提高解决方案的质量。另一方面,建设性的成分训练,是那些解决方案是从开始建立的解决方案,在每次迭代中找到局部最佳最佳。在本文中,我们可以通过解决经典的NP-COLLED问题,比较两个建设性的型化术,蚁群优化和智能水滴,例如设定的覆盖问题,这具有许多实际应用,包括线平衡生产,服务安装和船员在铁路中安排,等。结果表明,蚁群优化具有比考虑问题的智能水滴的更好行为。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号