...
首页> 外文期刊>Engineering Optimization >A variable neighbourhood search algorithm with novel archive update strategies for redundancy allocation problems
【24h】

A variable neighbourhood search algorithm with novel archive update strategies for redundancy allocation problems

机译:具有新颖档案更新策略的可变邻域搜索算法,用于冗余分配问题

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

摘要

This article proposes a variable neighbourhood search algorithm with novel archive update strategies (VNSAU) to solve redundancy allocation problems with the series-parallel system configuration. When solving single-objective optimization problems with different constraint levels, traditional approaches can only deal with one constraint level at a time. This usually leads to the waste of search information and extra computational effort. Different from traditional VNS algorithms, the proposed VNSAU algorithm employs an archive originally derived from the idea of Pareto optimal set in multi-objective optimization to keep track of the best solutions on different constraint levels. The performance of the proposed VNSAU algorithm is tested on a well-known benchmark suite with 33 instances. Computational results show that VNSAU outperforms seven other competing methods in the literature. The number of evaluations and the central processing unit (CPU) time needed by VNSAU also surpass other methods.
机译:本文提出了一种具有新颖档案更新策略(VNS AU )的可变邻域搜索算法,以解决串并联系统配置中的冗余分配问题。在解决具有不同约束级别的单目标优化问题时,传统方法一次只能处理一个约束级别。这通常导致搜索信息的浪费和额外的计算量。与传统的VNS算法不同,所提出的VNS AU 算法采用了一个最初从帕累托最优集的思想衍生而来的存档,用于多目标优化,以跟踪不同约束级别上的最佳解决方案。建议的VNS AU 算法的性能在具有33个实例的著名基准套件上进行了测试。计算结果表明,VNS AU 优于文献中的其他七个竞争方法。 VNS AU 所需的评估数量和中央处理器(CPU)时间也超过了其他方法。

著录项

  • 来源
    《Engineering Optimization》 |2012年第3期|p.289-303|共15页
  • 作者

  • 作者单位

    Department of Industrial Engineering and Management, Yuan Ze University, Taiwan, ROC;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号