Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman problem
Fuente:
Redalyc
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artículo científico |
| Langue: | en |
| Publié: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1876440209068916736 |
|---|---|
| author | Kusum Deep |
| author_facet | Kusum Deep |
| contents | Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman problem Kusum Deep Hadush Mebrahtu Computación Genetic Algorithms The Travelling Salesman problem Inverted Exchange and Inverted Displacement Mutations In this study two combined mutation operators have been developed to increase the performance of Genetic Algorithm that helps to find the minimum cost in the known Travelling Salesman problem (TSP). In order to do this the combined mutation operators which are named as Inverted Exchange and Inverted Displacement are compared with four existing mutation operators. These are programmed in C++ and algorithms, ten bench mark test problems and five variations of order crossover are used. Based implemented on a set of benchmark test problems taken from the TSPLIB. The crossover operator used here is the order crossover using two of its existing and three of its new variations. In general six mutations on the numerical and graphical analysis it indicates that the Inverted Displacement has a definite supremacy over the existing four mutations except for few instances considered here. The Inversion mutation is second best performer. All optimal values found in the six mutations are obtained when the new variations of order crossover are used. 2011 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265219635002 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.3 Vol.2 |
| format | Artículo científico |
| id | redalyc_265219635002 |
| institution | Redalyc |
| language | en |
| publishDate | 2011 |
| publisher | International Journal of Combinatorial Optimization Problems and Informatics |
| spellingShingle | Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman problem Kusum Deep Computación Genetic Algorithms The Travelling Salesman problem Inverted Exchange and Inverted Displacement Mutations Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman problem Kusum Deep Hadush Mebrahtu Computación Genetic Algorithms The Travelling Salesman problem Inverted Exchange and Inverted Displacement Mutations In this study two combined mutation operators have been developed to increase the performance of Genetic Algorithm that helps to find the minimum cost in the known Travelling Salesman problem (TSP). In order to do this the combined mutation operators which are named as Inverted Exchange and Inverted Displacement are compared with four existing mutation operators. These are programmed in C++ and algorithms, ten bench mark test problems and five variations of order crossover are used. Based implemented on a set of benchmark test problems taken from the TSPLIB. The crossover operator used here is the order crossover using two of its existing and three of its new variations. In general six mutations on the numerical and graphical analysis it indicates that the Inverted Displacement has a definite supremacy over the existing four mutations except for few instances considered here. The Inversion mutation is second best performer. All optimal values found in the six mutations are obtained when the new variations of order crossover are used. 2011 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265219635002 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.3 Vol.2 |
| title | Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman problem |
| topic | Computación Genetic Algorithms The Travelling Salesman problem Inverted Exchange and Inverted Displacement Mutations |
| url | https://www.redalyc.org/articulo.oa?id=265219635002 |