首页> 外文期刊>Mathematical Problems in Engineering >A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section
【24h】

A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section

机译:VNS元启发式算法,具有针对最大3切口和最大3截面的随机步骤

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

摘要

A heuristic algorithm based on VNS is proposed to solve the Max 3-cut and Max 3-section problems. By establishing a neighborhood structure of the Max 3-cut problem, we propose a local search algorithm and a variable neighborhood global search algorithm with two stochastic search steps to obtain the global solution. We give some numerical results and comparisons with the well-known 0.836-approximate algorithm. Numerical results show that the proposed heuristic algorithm can obtain efficiently the high-quality solutions and has the better numerical performance than the 0.836-approximate algorithm for the NP-Hard Max 3-cut and Max 3-section problems.
机译:提出了一种基于VNS的启发式算法来解决Max 3-cut和Max 3-section问题。通过建立Max 3-cut问题的邻域结构,我们提出了一种局部搜索算法和一个具有两个随机搜索步骤的可变邻域全局搜索算法,以获得全局解。我们给出了一些数值结果,并与著名的0.836近似算法进行了比较。数值结果表明,所提出的启发式算法可以有效地获得高质量的解,并且比NP-Hard Max 3-cut和Max 3-section问题的0.836近似算法具有更好的数值性能。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2012年第8期|475018.1-475018.16|共16页
  • 作者

    Ai-fan Ling;

  • 作者单位

    Research Center of Security and Future, School of Finance, Jiangxi University of Finance and Economics,Nanchang 330013, China,Key Laboratory of Management, Decision and Information Systems, Academy of Mathematics and Systems Science, CAS, Beijing 100190, China;

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

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号