Rank: 433203 based on 0 downloads (last 30 days) and 0 file submitted
photo

virat rehani

E-mail
Company/University
mmu

Personal Profile:

Pursuing Masters of Technology.
Completed Masters of Information technology.
Completed Post-Graduation in Computer applications.


 

Watch this Author's files

 

Comments and Ratings by virat rehani View all
Updated File Comments Rating
05 Oct 2014 Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA Author: Joseph Kirk

Thanks to the idea of Mr.Josph Kirk and my co- guide (Mr.U. Sharma) for the following suggestion and implementation with figure 4 instead of 8.

{"tim: POP_SIZE must be divisible by 8 because of the way good solutions in the current population are propagated to the next iteration.

(I randomly group 8 citizens at a time, take the best one of those eight, and pass it on to the next generation. I then perform 3 different mutations on that best-of-four citizen: flip, swap, and slide. I make copies of the best-of-four and three mutated versions and mix up the length of the salesmen routes for each. The seven modified solutions are then passed on to the next generation)."}

24 Apr 2013 Multiple Traveling Salesmen Problem - Genetic Algorithm Finds a near-optimal solution to a M-TSP using a GA Author: Joseph Kirk

sir what if we are to take the data from solomon's bench mark sheets.
vrehani@yahoo.com

Contact us