首页> 外文会议>IEEE International Symposium on Parallel and Distributed Processing >Distributed Bees Foraging-Based Algorithm for Large-Scale Problems
【24h】

Distributed Bees Foraging-Based Algorithm for Large-Scale Problems

机译:分布式蜜蜂觅食的基于大规模问题的算法

获取原文

摘要

The optimization process of large-scale computational problems presents various issues that need to be solved in order to achieve favorable results. One of the most significant challenges faced is the computational costs of these problems. These costs force researchers to use large-scale computational resources. Parallel implementations of different algorithms may be considered. However, these techniques present issues when dealing with problems in which a high variability in the execution time of the evaluation function takes place. This paper presents an algorithm designed to efficiently optimize these large-scale optimization problems with different execution times for the evaluation of the candidate solutions. Production grid computing infrastructures are used to carry out these optimizations. The own paradigm of the grid introduces new challenges in the process that must to be taken into account in the design of the algorithm.
机译:大规模计算问题的优化过程呈现需要解决的各种问题,以实现有利的结果。面临最重要的挑战之一是这些问题的计算成本。这些成本迫使研究人员使用大规模的计算资源。可以考虑不同算法的并行实现。然而,这些技术在处理涉及评估函数的执行时间中的高可变性时存在问题。本文介绍了一种算法,旨在有效地优化这些大型优化问题,在候选解决方案的评估中使用不同的执行时间进行了不同的执行时间。生产网格计算基础架构用于执行这些优化。网格的自身范式在算法设计中引入了必须考虑的过程中的新挑战。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号