Adaptation of Parallel Framework to Solve Traveling Salesman Problem Using Genetic Algorithms and Tabu Search
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.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.