Parallelization of genetic algorithms using Hadoop Map/Reduce
نویسندگان
چکیده
In this paper we present parallel implementation of genetic algorithm using map/reduce programming paradigm. Hadoop implementation of map/reduce library is used for this purpose. We compare our implementation with implementation presented in [1]. These two implementations are compared in solving One Max (Bit counting) problem. The comparison criteria between implementations are fitness convergence, quality of final solution, algorithm scalability, and cloud resource utilization. Our model for parallelization of genetic algorithm shows better performances and fitness convergence than model presented in [1], but our model has lower quality of solution because of species problem. Keywords— genetic algorithm, parallelization, map/reduce, hadoop.
منابع مشابه
Medical Application of Privacy Preservation by Big Data Analysis Using Hadoop Map Reduce Framework
The Map Reduce framework has become the de-facto framework for large-scale data analysis and data mining. The computer industry is being challenged to develop methods and techniques for affordable data processing on large datasets at optimum response times. The technical challenges in dealing with the increasing demand to handle vast quantities of data is daunting and on the rise. One of the re...
متن کاملA Map Reduce Hadoop Implementation of Random Tree Algorithm based on Correlation Feature Selection
Random Tree is a popular data classification classifier for machine learning. Feature reduction is one of the important research issues in big data. Most existing feature reduction algorithms are now faced with two challenging problems. On one hand, they have infrequently taken granular computing into thinking. On the other hand, they still cannot deal with massive data. Massive data processing...
متن کاملA Parallel Genetic Algorithm for Generalized Vertex Cover Problem
This paper presents a parallel genetic algorithm for generalised vertex cover problem( GVCP) using Hadoop Map-Reduce framework. The proposed Map-Reduce implementation helps to run the genetic algorithm for generalized vertex cover problem(GVCP) on multiple machines parallely and computes the solution in relatively short time. Keywords— Parallel genetic algorithm,generalized vertex cover problem...
متن کاملA Parallel Genetic Algorithm for Three Dimensional Bin Packing with Heterogeneous Bins
This paper presents a parallel genetic algorithm for three dimensional bin packing with heterogeneous bins using Hadoop Map-Reduce framework. The most common three dimensional bin packing problem which packs given set of boxes into minimum number of equal sized bins is proven to be NP Hard. The variation of three dimensional bin packing problem that allows heterogeneous bin sizes and rotation o...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کامل