Skip to content

yc-cui/GA-for-TSP

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Genetic Algorithm for Traveling Salesman Problem

https://arxiv.org/abs/1402.4699

This package includes a powerful genetic algorithm (GA) for solving the traveling salesman problem (TSP).

To construct a powerful GA, edge swapping(ES) is applied with a local search procedure to determine good combinations of building blocks of parent solutions for generating even better offspring solutions.

Experimental results on well studied TSP benchmarks demonstrate that the proposed GA is competitive in finding very high quality solutions on instances with about 15,000 cities.

How to run

  1. go to ./src directory:
cd src
  1. run bash file run.sh and choose one of the five predefined TSP map as input:
sudo bash run.sh
  1. checkout TSP route in bestSolution.txt:
vi bestSolution.txt

License

Apache License 2.0

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 99.8%
  • Shell 0.2%