Paper Info
Title
Distributed Bees Foraging-Based Algorithm for Large-Scale Problems
Abstract
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.
Year
DOI
Venue
2011
10.1109/IPDPS.2011.355
IPDPS Workshops
Keywords
Field
DocType
different algorithm,execution time,large-scale optimization problem,different execution time,costs force researcher,evaluation function,large-scale computational problem,computational cost,large-scale problems,large-scale computational resource,optimization process,mathematical model,approximation algorithms,optimization,parallel processing,production,algorithm design and analysis,space exploration,grid computing
Mathematical optimization,Computational problem,Grid computing,Computer science,Algorithm,Evaluation function,Implementation,Execution time,Optimization problem,Grid,Foraging,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Antonio Gomez-Iglesias1152.93
Francisco Castejon221.38
Miguel A. Vega-Rodriguez314518.81