Traveling Salesman Problem

Aim:

The aim of the project is to solve the traveling salesmans problem

Description: Let us consider that there are around 300-500 cities that a sales man needs to travel. The cities are randomly distributed at various positions. Now an algorithm must be develop to derive a smallest route, which should define both the starting point and any of the intermediate points till the last point so that all the cities are covered and that too with the smallest possible cost. The algorithm has to face 300P300 probability options. Therefore we will adopt two schemes. First an algorithm will calculate some 50 shortest path from some arbitary source and destination. These paths will be fed to a genetic algorithm, which will continue to optimize the paths. The process will continue till there is no substantial variations in the cost functions.

System Design
1. [Start] Generate random population of n chromosomes (suitable solutions for the problem) 2. [Fitness] Evaluate the fitness f(x) of each chromosome x in the population 3. [New population] Create a new population by repeating following steps until the new population is complete 1. [Selection] Select two parent chromosomes from a population according to their fitness (the better fitness, the bigger chance to be selected) 2. [Crossover] With a crossover probability cross over the parents to form new offspring (children). If no crossover was performed, offspring is the exact copy of parents. 3. [Mutation] With a mutation probability mutate new offspring at each locus (position in chromosome). 4. [Accepting] Place new offspring in the new population 4. [Replace] Use new generated population for a further run of the algorithm 5. [Test] If the end condition is satisfied, stop, and return the best solution in current population 6. [Loop] Go to step 2

System Requirement
Hardware Requirements
1. P4/AMD athalon processor(min 32 bit processor, Best result in Core 2 Duo, Minimum 32 KB cache) 2. Minimum 1 GB RAM 3. Up to 4Gb Virtual Memory 4. Minimum 20 Gb Free space in Windows directory.

Software Requirements
1. Open GL