1

A PRESENTATION ON

Solving Traveling Salesman Problem By Using

Genetic Algorithm

Department of Electrical and Electronic Engineering

IUBAT- International University of Business Agriculture and Technology
 2

NAME ID

Ripon Sorma 17105006

Md. Abdul Wadud 17105079

SUPERVISOR NAME
S.M. Rezaul Karim
Senior Lecturer, Department of BSEEE
 3
Contents
1. Introduction
2. Research Motivation
3. Research Objective
4. Theoretical Overview
5. Literature Review
6. Problem Statement
7. Research Methodology
8. Result and Discussion
9. Conclusion
10.References
 4
Introduction

The traveling salesman problem (TSP) may be a well-known and important

combinatorial optimization problem. TSP was documented by Euler in 1759, whose
interest was in solving the knight’s tour problem. TSP can be described as the
minimization of the total distance traveled by touring all cities exactly once and return
to depot city.
 5
Research Motivation

 By using Traveling Salesman Problem, to find the best route (shortest path) can be
found.

 Genetic Algorithm provides best solution to Traveling Salesman Problem.

 Genetic Algorithm is easier then other optimization system to solve Traveling

Salesman Problem.
 6
Research Objective

 To apply Genetic Algorithm for solving Traveling Salesman Problem.

 To optimize Traveling Salesman Problem for vehicle routing problem.

 To analysis the performance of Genetic Algorithm to solve the problem of Traveling

Salesman Problem.
 7
Theoretical Overview

Genetic Algorithm

 Genetic Algorithms (GA) are adjective heuristic search algorithmic rule premised on
the organic process ideas of natural process and genetic.

 Genetic algorithm was introduced as a procedure analogy of adjective systems.

 Genetic algorithms are algorithms developed from the thought of genetic science.
 8
Theoretical Overview (Cont ….)
Control parameters

Initialize Population

Done Evaluation

Selection

Crossover

Mutation
 9
Theoretical Overview (Cont ….)
Evolutionary computation

 Evolutionary computation simulates evolution on a pc. The results of such a simulation

could be a series of improvement algorithms, typically supported a straightforward set
of rules.

 Genetic rule
 Genetic programming
 10
Theoretical Overview (Cont ….)
Advantage of Genetic Algorithm

Advantages

1. Simple to know.
2. In contrast to older AI systems, the GA don't break simply although the inputs modified
slightly.
3. GA are often utilized for a good sort of improvement issues.
 11
Literature Review

Varshika (2012) projected the work that uses TSP domain and its resolved using genetic
algorithmic rule operators. The genetic algorithmic rule is employed for the aim of
improving the answer house. The crossover is that the necessary stage within the genetic
algorithm.

Naveen (2012) have done the survey on the traveling salesman downside using varied
genetic algorithmic rule operators. The projected work solves the motion salesman
downside exploitation varied genetic algorithmic rule operators. The assorted ways for the
genetic algorithmic rule operators like choice ways, crossover ways and mutation methods
also are mentioned within the paper.
 12
Literature Review (Cont ….)

Omar (2009) projected associate degree improved genetic algorithmic rule wherever the
new crossover operation, population reformulation operation, multi-mutation operation,
partial local optimum mutation operation, and arranging operations area unit accustomed
solve the Traveling Salesman downside.

Kasassbeh et al (2012) projected a brand-new crossover methodology that is employed

and it's called as a Shared Crossover methodology. This methodology is easy and quick
and also the main aim is to reduce the execution time. This new technique depends on
passing as several as attainable of the shared methods between cities to following
generation with a guarantee that none of the cities can seem within the kid body quite
once when applying the crossover method. The experimental results conjointly show the
larger reduction within the time consumption.
 13
Problem Statement
The traveling salesman problem consists of a salesman and a set of cities. The salesman
has to visit each one of the cities starting from a certain one and returning to the same city.
The challenge of the problem is that the traveling salesman wants to minimize the total
length of the trip.
Research Methodology 14
 15
Research Methodology (Cont ….)
 Each city has road to each city. We need to find loop-path that will be in each city only
one time and path length is minimal.

 The genetic algorithm is sequence of following operations that repeated in

generations loop.

1. Generate random population.

2. Find probabilities for selection.
3. Prepare to crossover according probabilities.
4. Crossover, parents replaced with children.
5. Mutations.
 16
Research Methodology (Cont ….)
Create Random Population
 So we have a lot of paths with different lengths. A path can have crossover with
another path and mutate. After crossover it will be replaced by its children.

0 2.7 4.3 1.3 Path No 1

2.7 0 1.9 4 Path No 2
6.3 1.6 0 6.3 Path No 3

 Here we have population with 3 paths (population size ps=3), and it is for 4 cities.
 17
Research Methodology (Cont ….)
Fitness Evaluation

 To have fast calculation of paths length before start iteration, it is calculated in a

matrix of distances. It is a n x n matrix where n is number of cities, where (i1,i2) is
distance between city i1 and city i2.

 The logic used is that if we want to minimize distance then we want to maximize
inverse distance.

 Thus the fitness function we want to maximize is the inverse of distance f(x)= 1/d
 18
Research Methodology (Cont ….)
Crossover

 Here 𝑝𝑖 is probability of 𝑖 path to be put to crossover, 𝑑𝑖 is 𝑖 path length.

 For example we have 6 paths with numbers 1 2 3 4 5 6 and let it have probabilities 0.05 0.5 0.05
0.05 0.05 0.3

 By using roulette wheel indexes m function we will put for the crossover for example 1 2 6 2 6 2

 You can see that 2 most frequent and 6 also frequent, rest ELIMINATED. But all this is random.

 So after that we have pair wise crossover:

1 and 2 (gives 2 children)
6 and 2 (gives 2 children)
6 and 2 (gives 2 children)
 19
Research Methodology (Cont ….)
Mutation

 There are 3 types of mutations used:

1. Chose 2 random cities

and swap them,

Result:
 20
Research Methodology (Cont ….)

2. Mutation by exchange of 2 pieces of path :

 First randomly chose point of spit, for example between 2 and 3 positions:

now swap two pieces:

 21
Research Methodology (Cont ….)

3. Mutation of flip random piece of path

 First choose some random piece of path:

now flip it left-right:

 Elitism means that we save best path and put it manually to next generation without
changes.
Result And Discussion 22

 
 
Result And Discussion 23
 24
Result And Discussion (Cont ….)
Minimum total distance = 119.9000
Optimal solution = 4 1 5 7 9 3 6 2 8
10
Conclusion 25

The Genetic rule is economical and correct optimization approach. It is needs an

outsized quantity of memory and parallel system design for its complete
implementation. The genetic rule was found to still be the most effective in resolution
combinatorial optimization issues (as it's general united by man of science round the
world).
 26
Reference

[1] B. Freisieben and P. Merz, New Genetic native Search Operator for bagman
drawback, Conference on Parallel drawback determination From nature, app. 890-899,
1996.

[2] H. Braun, “On determination bagman drawback by Genetic Algorithm”, in Parallel

Problem- determination from Nature, Lecture Notes in engineering science 496, H.P.
Schwefel and R. Manner Eds, Springer-Verlag, app. 129-133

[3] M. Dorigo and L. M. Gambradella, hymenopteron Colony System: A Cooperative

Learning Approach to the bagman drawback, JEEE group action on biological process
Computation, Vol. l, pp. 53-66, 1997.
 27
Reference (Cont ….)

[4] D.E. Goldberg, Genetic formula in Search, improvement and Machine Learning.
Addison-Wesley, 1989.

[5] Naef Taher Al Rahedi and Jalal Atoum, determination TSP drawback victimization
New Operator in Genetic Algorithms, yankee Journal of Applied Sciences 6(8):1586-
1590, 2009.

[6] Reuben Lucius Goldberg D., Computer-Aided Pipeline Operations victimization

Genetic Algorithms and Rule Learning. half I; Genetic Algorithms in pipeline
improvement, Engineering with laptop three, 1987.

[7] Greffenstette, J., Genetic Algorithms created simple, 1991.

 28
Reference (Cont ….)

[8] Seniw, D., A Genetic formula for the bagman drawback, MSc Thesis, University of
North geographical region, at Charlotte.

[9] B. Freisleben and P. Merz, “A Genetic native search formula for determination
trigonal and uneven bagman issues,” International Conference On biological process
Computation, pp. 616-621, 1996.

[10] K. E. Nygard and C. H. Yang, ”Genetic formula for the bagman drawback With
Time Window”, in engineering science and Operations Research: New Development in
their Interface, O. Balci, R. Sharda and S. A. Zenios Eds, Pergamon Press, pp. 411-423.
 29

Solving Traveling Salesman Problem by Using Genetic

Algorithm

Electrical and Electronic Engineering

p-ISSN: 2162-9455    e-ISSN: 2162-8459
2020;  10(2): 27-31
doi:10.5923/j.eee.20201002.02
30