Skip to content

An approximate solution for the NP Hard Traveller Salesman Problem

Notifications You must be signed in to change notification settings

haouech/GeneticAlgorithmTSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Solution for Travelling Salesman Problem using Genetic Algorithm

This is a code built from scratch to solve TSP. I used 5 main functions:

  1. Encoding

  2. Evaluation

  3. Crossover

  4. Mutation

  5. Decoding

The process can be described by the following picture.

alt text

Encoding

Evaluation

Crossover

Mutation

Decoding

About

An approximate solution for the NP Hard Traveller Salesman Problem

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages