1 publication

• Published Subscription 8 Jul 2019

  Genetic Algorithms for DTSP: A Study of Different Mutation Rates

  By Nitesh M. Sureja, Ved Vyas Dwivedi

  Abstract: ABSTRACTThis 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 …

  Published in Journal of Computer Technology & Applications · Vol. 3, Issue 3, 2012 · pp. 21–27 Read article →