Abstract
In this paper, we present an efficient Hierarchical Parallel Genetic Algorithm framework using Grid computing (GE-HPGA). The framework is developed using standard Grid technologies, and has two distinctive features: (1) an extended GridRPC API to conceal the high complexity of the Grid environment, and (2) a metascheduler for seamless resource discovery and selection. To assess the practicality of the framework, a theoretical analysis of the possible speed-up offered is presented. An empirical study on GE-HPGA using a benchmark problem and a realistic aerodynamic airfoil shape optimization problem for diverse Grid environments having different communication protocols, cluster sizes, processing nodes, at geographically disparate locations also indicates that the proposed GE-HPGA using Grid computing offers a credible framework for providing a significant speed-up to evolutionary design optimization in science and engineering. © 2006 Elsevier Ltd. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Lim, D., Ong, Y. S., Jin, Y., Sendhoff, B., & Lee, B. S. (2007). Efficient Hierarchical Parallel Genetic Algorithms using Grid computing. Future Generation Computer Systems, 23(4), 658–670. https://doi.org/10.1016/j.future.2006.10.008
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.