Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman problem

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...

תיאור מלא

שמור ב:
מידע ביבליוגרפי
הוצא לאור ב:International Journal of Combinatorial Optimization Problems and Informatics
Main Authors: Kusum Deep, Hadush Mebrahtu
פורמט: Artigo
שפה:Inglês
יצא לאור: International Journal of Combinatorial Optimization Problems and Informatics 2011
נושאים:
Computación
Genetic Algorithms
The Travelling Salesman problem
Inverted Exchange and Inverted Displacement Mutations
גישה מקוונת:https://www.redalyc.org/articulo.oa?id=265219635002
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים