Adaptation of Parallel Framework to Solve Traveling Salesman Problem Using Genetic Algorithms and Tabu Search
Alber Barros Miranda, Daladier Jabba, Carlos Julio Ardila Hernandez, Luis Guzman Reyes, Jonathan Ruiz-Range · 2021
The modeling of combinatorial optimization problems has acquired great importance both for research in mathematical processes and for companies starting new projects and seeking to identify the most efficient, beneficial and economic implementation. One of the most investigated combinatorial problems in optimization studies is the traveling salesman problem (TSP). Here we describe a parallel strategy to solve TSP problem using genetic algorithm and Tabu search based on framework(Guzman, N. Ruiz, Ardila, Jabba and Nieto, 2016) which make a solution through parallel processing within a Master-Slave structure. In addition, the proposed approach is compared with an existing algorithm.