Hadoop MapReduce for Parallel Genetic Algorithm to Solve Traveling Salesman Problem

Achieving an optimal solution for NP-complete problems is a big challenge nowadays. The paper deals with the Traveling Salesman Problem (TSP) one of the most important combinatorial optimization problems in this class. We investigated the Parallel Genetic Algorithm to solve TSP. We proposed a general platform based on Hadoop MapReduce approach for implementing parallel genetic algorithms. Two versions of parallel genetic algorithms (PGA) are implemented, a Parallel Genetic Algorithm with Islands Model (IPGA) and a new model named an Elite Parallel Genetic Algorithm using MapReduce (EPGA) which improve the population diversity of the IPGA. The two PGAs and the sequential version of the algorithm (SGA) were compared in terms of quality of solutions, execution time, speedup and Hadoop overhead. The experimental study revealed that both PGA models outperform the SGA in terms of execution time, solution quality when the problem size is increased. The computational results show that the EPGA model outperforms the IPGA in term of solution quality with almost similar running time for all the considered datasets and clusters. Genetic Algorithms with MapReduce platform provide better performance for solving large-scale problems.

@article{Alanzi2019,
  title     = {Hadoop MapReduce for Parallel Genetic Algorithm to Solve Traveling Salesman Problem},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {10},
  number    = {8},
  year      = {2019},
  publisher = {The Science and Information Organization},
  author    = {Entesar Alanzi and Hachemi Bennaceur},
  doi       = {10.14569/IJACSA.2019.0100814},
  url       = {https://doi.org/10.14569/IJACSA.2019.0100814}
}