Cover Page    Full-Text Download    
Subscribe Now
Recommend the Paper
Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster  

Harun Raşit Er1,Nadia Erdoğan2

*1 Istanbul Technical University, Turkey, Email : harunrasiter@gmail.com
2 Istanbul Technical University, Turkey, Email : nerdogan@itu.edu.tr
 
Abstract .Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial optimization. Given the list of cities and distances between them, the problem is to find the shortest tour possible which visits all the cities in list exactly once and ends in the city where it starts. Despite the Traveling Salesman Problem is NP-Hard, a lot of methods and solutions are proposed to the problem. One of them is Genetic Algorithm (GA). GA is a simple but an efficient heuristic method that can be used to solve Traveling Salesman Problem. In this paper, we will show a parallel genetic algorithm implementation on MapReduce framework in order to solve Traveling Salesman Problem. MapReduce is a framework used to support distributed computation on clusters of computers. We used free licensed Hadoop implementation as MapReduce framework.
 
Keywords : Hadoop ; MapReduce ; TSP ; Genetic Algorithm

Citation:  
Harun Raşit Er, Nadia Erdoğan ,"Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster", International Journal of Soft Computing and Software Engineering [JSCSE], Vol. 3, No. 3, pp. 380-386, 2013, Doi: 10.7321/jscse.v3.n3.57
 URL: http://dx.doi.org/10.7321/jscse.v3.n3.57  
 
 

Subscribe Now

Email :
Subscribe to receive free TOC's JSCSE by email 		Subscribe

Recommend To Friend

Email : People