Abstract
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.
Highlights
Genetic algorithm is heuristic optimization method which mimics the process of natural evolution
Optimization problems like Traveling Salesman require a lot of computer resources to be solved even if we use genetic algorithm as optimization method
During the shuffle phase the underlying system that implements Map/Reduce sends all of the values that are associated with an individual key to the same machine
Summary
Abstract—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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have