Skip to content
forked from hakosaj/KandiTSP

A C++ Simulation for Travelling Salesman Problem with Genetic Algorithms. Part of my B.Sc thesis!

Notifications You must be signed in to change notification settings

jandelmi/KandiTSP

 
 

Repository files navigation

Genetic Algorithms in Travelling Salesman Problem

As a part of my Bachelor's thesis, I made a simulation for doing TSP with Genetic Algorithms. Feel free to use and improve!

Overview of the simulationOverview of the simulation

Getting Started

Simply clone the repository to a directory, compile and we are good to go!

Prerequisites

-SFML, at least version 2.5.1.

Using the software

Get the software from Github and simply make in the folder.

Then simply run the file, the software tells you what to do!

In order to use further instances, those can be downloaded here for example: https://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

Make sure to format them to csv, same format as the other files!

Next steps

  • Refactor the 2-opt swap procedure to correspond that of the 3-opt to optimize the performance
  • LKH implementation!
  • GPU-computation

Authors

  • Jussi Hakosalo - All of it - hakosaj

License

This project is licensed under the MIT License

Acknowledgments

  • Juho Andelmin (my dear supervisor).
  • Perttu Yli-Opas, Juuso Kylmäoja and Pietari Kaskela for pushing me onwards.

About

A C++ Simulation for Travelling Salesman Problem with Genetic Algorithms. Part of my B.Sc thesis!

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 97.1%
  • C 1.5%
  • Makefile 1.4%