• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mathematical Problems in Engineering >Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs
【24h】

Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs

机译：启发式和元启发式算法在求解有界弧约束的约束韦伯问题中的应用

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The continuous planar facility location problem with the connected region of feasible solutions bounded by arcs is a particular case of the constrained Weber problem. This problem is a continuous optimization problem which has a nonconvex feasible set of constraints. This paper suggests appropriate modifications of four metaheuristic algorithms which are defined with the aim of solving this type of nonconvex optimization problems. Also, a comparison of these algorithms to each other aswell as to the heuristic algorithm is presented. The artificial bee colony algorithm, firefly algorithm, and their recently proposed improved versions for constrained optimization are appropriately modified and applied to the case study. The heuristic algorithm based on modified Weiszfeld procedure is also implemented for the purpose of comparison with the metaheuristic approaches. Obtained numerical results show that metaheuristic algorithms can be successfully applied to solve the instances of this problem of up to 500 constraints. Among these four algorithms, the improved version of artificial bee algorithm is the most efficient with respect to the quality of the solution, robustness, and the computational efficiency.
机译：具有圆弧界定的可行解的连接区域的连续平面设施位置问题是受约束韦伯问题的特例。这个问题是一个连续优化问题，它具有一组非凸可行约束。本文提出了对四种元启发式算法的适当修改，这些算法旨在解决这类非凸优化问题。此外，还介绍了这些算法之间的比较以及启发式算法。对人工蜂群算法，萤火虫算法及其最近提出的用于约束优化的改进版本进行了适当修改，并将其应用于案例研究。为了与元启发式方法进行比较，还实现了基于改进的Weiszfeld过程的启发式算法。获得的数值结果表明，元启发式算法可以成功地应用于解决多达500个约束条件的实例。在这四种算法中，就解决方案的质量，鲁棒性和计算效率而言，人工蜂算法的改进版本是最有效的。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2017年第6期|8306732.1-8306732.13|共13页
  • 作者

    Stojanovic Igor; Brajevic Ivona; Stanimirovic Predrag S.; Kazakovtsev Lev A.; Zdravev Zoran;

  • 作者单位

    Goce Delcev Univ, Fac Comp Sci, Goce Delcev 89, Stip 2000, Macedonia;

    Univ Nis, Fac Sci & Math, Dept Math & Informat, Visegradska 33, Nish 18000, Serbia;

    Univ Nis, Fac Sci & Math, Dept Math & Informat, Visegradska 33, Nish 18000, Serbia;

    Reshetnev Univ, Dept Syst Anal & Operat Res, Prosp Krasnoyarskiy Rabochiy 31, Krasnoyarsk 660037, Russia;

    Goce Delcev Univ, Fac Comp Sci, Goce Delcev 89, Stip 2000, Macedonia;

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

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号