Genetic Algorithms for DTSP: A Study of Different Mutation Rates

Auteurs-es

  • Nitesh M. Sureja GTU, Gujarat- INDIA
  • Ved Vyas Dwivedi GTU, Gujarat- INDIA

Mots-clés :

Genetic algorithms, traveling salesman problem, genetic operators, pseudo-code

Résumé

 This paper deals with performance evaluation of genetic algorithms (GAs) for the dynamic traveling salesman problem (DTSP) using different values of mutation rates. DTSP is known to be NP-hard, and consists of the solution containing N! permutations. The objective of the study is to evaluate the ability of GA to solve the optimization problems using some variations in its parameters. All performance evaluation has been performed using a software program developed in the Matlab environment. The results clearly suggest that different settings of parameters like mutation operator can give us better solutions than using static parameter settings. GA clearly demonstrates good results for DTSP with different values of mutation rates. Keywords: Genetic algorithms, traveling salesman problem, genetic operators, pseudo-code 

Biographies de l'auteur-e

  • Nitesh M. Sureja, GTU, Gujarat- INDIA
    Associate Professor,Department of Computer Engineering,G H Patel College of Enginering & Technology,Vallabh Vidyanagar - 388120 
  • Ved Vyas Dwivedi, GTU, Gujarat- INDIA
    Principal/DirectorNoble Group of Institutions,Junagadh, Gujarat, INDIA

Publié

2012-12-03

Numéro

Rubrique

Research Articles