<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p><bold>Background:</bold> The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem. <bold>Objectives:</bold> In this paper we study the influence of hybridization of a genetic algorithm with a local optimizer on solving instances of the Travelling Salesman Problem. <bold>Methods/Approach:</bold> Our algorithm uses hybridization that occurs at various percentages of generations of a genetic algorithm. Moreover, we have also studied at which generations to apply the hybridization and hence applied it at random generations, at the initial generations, and at the last ones. <bold>Results:</bold> We tested our algorithm on instances with sizes ranging from 76 to 439 cities. On the one hand, the less frequent application of hybridization decreased the average running time of the algorithm from 14.62 sec to 2.78 sec at 100% and 10% hybridization respectively, while on the other hand, the quality of the solution on average deteriorated only from 0.21% till 1.40% worse than the optimal solution. <bold>Conclusions:</bold> In the paper we have shown that even a small hybridization substantially improves the quality of the result. Moreover, the hybridization in fact does not deteriorate the running time too much. Finally, our experiments show that the best results are obtained when hybridization occurs in the last generations of the genetic algorithm.</p></abstract>

Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem. Objectives: In this paper we study the influence of hybridization of a genetic algorithm with a local optimizer on solving instances of the Travelling Salesman Problem. Methods/Approach: Our algorithm uses hybridization that occurs at various percentages of generations of a genetic algorithm. Moreover, we have also studied at which generations to apply the hybridization and hence applied it at random generations, at the initial generations, and at the last ones. Results: We tested our algorithm on instances with sizes ranging from 76 to 439 cities. On the one hand, the less frequent application of hybridization decreased the average running time of the algorithm from 14.62 sec to 2.78 sec at 100% and 10% hybridization respectively, while on the other hand, the quality of the solution on average deteriorated only from 0.21% till 1.40% worse than the optimal solution. Conclusions: In the paper we have shown that even a small hybridization substantially improves the quality of the result. Moreover, the hybridization in fact does not deteriorate the running time too much. Finally, our experiments show that the best results are obtained when hybridization occurs in the last generations of the genetic algorithm.

Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem

Department of Information Science and Technology, University of Primorska, Koper, Slovenia

Business Systems Research Journal

Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many...

Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem

Publié en ligne: 17 sept. 2012

Pages: 14 - 22

DOI: https://doi.org/10.2478/v10305-012-0002-4

Mots clés
genetic algorithm, travelling salesman problem, hybridization, optimization, grafted genetic algorithm

This content is open access.

Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem

Publié en ligne: 17 sept. 2012

Pages: 14 - 22

DOI: https://doi.org/10.2478/v10305-012-0002-4

Mots clésgenetic algorithm, travelling salesman problem, hybridization, optimization, grafted genetic algorithm

This content is open access.

Mots clés
genetic algorithm, travelling salesman problem, hybridization, optimization, grafted genetic algorithm