Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
76 views6 pages

TSP Optimization with Genetic Algorithm

The document is a project report on solving the Travelling Salesman Problem using a Genetic Algorithm. It was submitted by three students from Pune Institute of Computer Technology to partially fulfill their Bachelor of Engineering degree in Computer Engineering from Savitribai Phule Pune University. The problem is to find the shortest route for a salesman to visit each city once and return to the starting point. The genetic algorithm is applied using cities as genes, routes as chromosomes, and path length as fitness score. Operators like selection, crossover and mutation are used in the algorithm to iteratively find improved solutions until an optimal route is determined. Screenshots demonstrating the implementation are included. The project concluded having successfully applied and learned genetic algorithms

Uploaded by

Wow Bollywood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views6 pages

TSP Optimization with Genetic Algorithm

The document is a project report on solving the Travelling Salesman Problem using a Genetic Algorithm. It was submitted by three students from Pune Institute of Computer Technology to partially fulfill their Bachelor of Engineering degree in Computer Engineering from Savitribai Phule Pune University. The problem is to find the shortest route for a salesman to visit each city once and return to the starting point. The genetic algorithm is applied using cities as genes, routes as chromosomes, and path length as fitness score. Operators like selection, crossover and mutation are used in the algorithm to iteratively find improved solutions until an optimal route is determined. Screenshots demonstrating the implementation are included. The project concluded having successfully applied and learned genetic algorithms

Uploaded by

Wow Bollywood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Pune Institute of Computer Technology,

Dhankavdi,Pune
DEPARTMENT OF COMPUTER ENGINEERING
A
Project Report
On

“Travelling Salesman Problem using Genetic Algorithm”


Submitted by

Gautam Kothari (41232)

Madhulika Sawant (41237)

Omkar Mankar (41239)


In partial fulfillment of

BACHELOR OF ENGINEERING
In
Computer Engineering

Savitribai Phule Pune University, Pune


INTRODUCTION
Given a asset of cities and distance between every pair of cities, the travelling salesman
problem is to find the shortest possible route that visits every city exactly once and returns to
the starting point. The problem is solved using genetic algorithm and displays a plot of the best
route found.

OBJECTIVE
To Apply Genetic Algorithm for given TSP problem.

H/W AND S/W REQUIREMENTS

Hardware Requirements: PIV, 2GB RAM, 500 GB HDD, Lenovo A13-4089Model

Software Requirements : Anaconda with Python 3.7

THEORY CONCEPTS

These algorithms can be implemented to find a solution to the optimization problems


of various types. One such problem is the Traveling Salesman Problem. The
problem says that a salesman is given a set of cities, he has to find the shortest
route to as to visit each city exactly once and return to the starting city.

Approach: In the following implementation, cities are taken as genes, route to be


followed is the chromosome. The fitness score which is equal to the inverse of
path length of a given route.

Operators Used:

1. Selection – Tournament selection without replacement


2. Crossover – Order crossover with window size 3
3. Mutation – Swap mutation

Algorithm:

1. Initialize the population randomly.


2. Determine the fitness of the chromosome.
3. Until done repeat:
1. Select parents.
2. Perform crossover and mutation.
3. Calculate the fitness of the new population.
4. Append it to the gene pool.
Advantages of GA’s

• Does not require any derivative information (which may not be available for many real- world
problems).

• Is faster and more efficient as compared to the traditional methods. • Has very good parallel
capabilities.

• Optimizes both continuous and discrete functions and also multi-objective problems. •
Provides a list of “good” solutions and not just a single solution.

• Always gets an answer to the problem, which gets better over the time.

• Useful when the search space is very large and there are a large number of parameters
involved.

Limitations of GA’s

• GAs are not suited for all problems, especially problems which are simple and for which
derivative information is available.

• Fitness value is calculated repeatedly which might be computationally expensive for some
problems.

• Being stochastic, there are no guarantees on the optimality or the quality of the solution.

• If not implemented properly, the GA may not converge to the optimal solution.
SCREENSHOTS
CONCLUSION

Hence ,Successfully studied and practically implemented Travelling Salesman Problem and
learnt Genetic Algorithm for optimization.

You might also like