Scribd
Upload
25 views4 pages

Traveling Salesman Problem Using Genetic Algorithm.12112238

This document describes using a genetic algorithm to solve the traveling salesman problem. It defines classes to represent individuals with genes/genomes and fitness values. It generates initial random genomes, calculates fitness, and uses mutation and selection to evolve new populations over generations by favoring individuals with higher fitness. The algorithm runs for a set number of generations or until the temperature cools below a threshold, with the goal of finding the shortest traveling salesman route.

Uploaded by

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

Traveling Salesman Problem Using Genetic Algorithm.12112238

This document describes using a genetic algorithm to solve the traveling salesman problem. It defines classes to represent individuals with genes/genomes and fitness values. It generates initial random genomes, calculates fitness, and uses mutation and selection to evolve new populations over generations by favoring individuals with higher fitness. The algorithm runs for a set number of generations or until the temperature cools below a threshold, with the goal of finding the shortest traveling salesman route.

Uploaded by

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

#Traveling Salesman Problem using Genetic Algorithm

from random import randint

INT_MAX = 2147483647

V = 5

GENES = "ABCDE"

START = 0

POP_SIZE = 10

class individual:
def __init__(self) -> None:
self.gnome = ""
self.fitness = 0

def __lt__(self, other):


return self.fitness < other.fitness

def __gt__(self, other):


return self.fitness > other.fitness

def rand_num(start, end):


return randint(start, end-1)

def repeat(s, ch):


for i in range(len(s)):
if s[i] == ch:
return True

return False

def mutatedGene(gnome):
gnome = list(gnome)
while True:
r = rand_num(1, V)
r1 = rand_num(1, V)
if r1 != r:
temp = gnome[r]
gnome[r] = gnome[r1]
gnome[r1] = temp
break
return ''.join(gnome)

def create_gnome():
gnome = "0"
while True:
if len(gnome) == V:
gnome += gnome[0]
break

temp = rand_num(1, V)
if not repeat(gnome, chr(temp + 48)):
gnome += chr(temp + 48)

return gnome

def cal_fitness(gnome):
mp = [
[0, 2, INT_MAX, 12, 5],
[2, 0, 4, 8, INT_MAX],
[INT_MAX, 4, 0, 3, 3],
[12, 8, 3, 0, 10],
[5, INT_MAX, 3, 10, 0],
]
f = 0
for i in range(len(gnome) - 1):
if mp[ord(gnome[i]) - 48][ord(gnome[i + 1]) - 48] == INT_MAX:
return INT_MAX
f += mp[ord(gnome[i]) - 48][ord(gnome[i + 1]) - 48]

return f

def cooldown(temp):
return (90 * temp) / 100

def TSPUtil(mp):
gen = 1
gen_thres = 5

population = []
temp = individual()

for i in range(POP_SIZE):
temp.gnome = create_gnome()
temp.fitness = cal_fitness(temp.gnome)
population.append(temp)

print("\nInitial population: \nGNOME FITNESS VALUE\n")


for i in range(POP_SIZE):
print(population[i].gnome, population[i].fitness)
print()

found = False
temperature = 10000

while temperature > 1000 and gen <= gen_thres:


population.sort()
print("\nCurrent temp: ", temperature)
new_population = []

for i in range(POP_SIZE):
p1 = population[i]

while True:
new_g = mutatedGene(p1.gnome)
new_gnome = individual()
new_gnome.gnome = new_g
new_gnome.fitness = cal_fitness(new_gnome.gnome)

if new_gnome.fitness <= population[i].fitness:


new_population.append(new_gnome)
break

else:
prob = pow(
2.7,
-1
* (
(float)(new_gnome.fitness - population[i].fitness)
/ temperature
),
)
if prob > 0.5:
new_population.append(new_gnome)
break

temperature = cooldown(temperature)
population = new_population
print("Generation", gen)
print("GNOME FITNESS VALUE")

for i in range(POP_SIZE):
print(population[i].gnome, population[i].fitness)
gen += 1

if __name__ == "__main__":

mp = [
[0, 2, INT_MAX, 12, 5],
[2, 0, 4, 8, INT_MAX],
[INT_MAX, 4, 0, 3, 3],
[12, 8, 3, 0, 10],
[5, INT_MAX, 3, 10, 0],
]
TSPUtil(mp)

You might also like