首页> 外文期刊>Journal of mathematical modelling and alogrithms >A Meta-heuristic with Orthogonal Experiment for the Set Covering Problem
【24h】

A Meta-heuristic with Orthogonal Experiment for the Set Covering Problem

机译:集合覆盖问题的元启发式正交试验

获取原文
获取原文并翻译 | 示例
           

摘要

This paper reports an evolutionary meta-heuristic incorporating fuzzy evaluation for some large-scale set covering problems originating from the public transport industry. First, five factors characterized by fuzzy membership functions are aggregated to evaluate the structure and generally the goodness of a column. This evaluation function is incorporated into a refined greedy algorithm to make column selection in the process of constructing a solution. Secondly, a self-evolving algorithm is designed to guide the constructing heuristic to build an initial solution and then improve it. In each generation an unfit portion of the working solution is removed. Broken solutions are repaired by the constructing heuristic until stopping conditions are reached. Orthogonal experimental design is used to set the system parameters efficiently, by making a small number of trials. Computational results are presented and compared with a mathematical programming method and a GA-based heuristic.
机译:本文报告了一种进化的元启发式方法,该方法结合了模糊评估方法,对一些大型集合进行了覆盖,这些集合涵盖了源自公共交通行业的问题。首先,将以模糊隶属函数为特征的五个因素进行汇总,以评估结构和总体上的优劣。将此评估函数并入改进的贪婪算法中,以在构造解决方案的过程中进行列选择。其次,设计了一种自演化算法来指导构造启发式算法建立初始解,然后对其进行改进。在每一代中,去除工作溶液中不合适的部分。通过构造启发式方法修复损坏的解决方案,直到达到停止条件为止。通过进行少量试验,正交实验设计可有效地设置系统参数。提出了计算结果,并与数学编程方法和基于GA的启发式算法进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号