Solving Travelling Salesman Problem Using Genetic Algorithm

Daniel Oyeleke SHOKEFUN
Computer Science, Federal University of Agriculture, Abeokuta
December, 2013
Full text (external site)
 

Abstract

The project work gives an incite into the use of genetic algorithm in solving Travelling salesman problem. Genetic algorithm uses it evolutionary processes to generate an optimal solution; finding a shortest minimum route through a city. According to the kind of Problem, genetic algorithm profiles its solution. The effectiveness of this algorithm is verified by comparing it with the other algorithms and the time spent in computation. The challenges, advantages and the disadvantages of this algorithm are discussed.