High Level Synthesis - Solving TSP with Genetic Algorithm

About The Project

The repository includes an implementation of Genetic Algorithm solving the Traveling Salesman Problem for High Level Synthesis.

The project was implemented for the purposes of the Hardware Design for High Level Synthesis course of the 9th semester of DUTh.

This repository contains 2 branches:

• software: Contains the developed C++ code that can be run locally in any IDE.
• hardware: Contains the developed C++ code adjusted for Catapult HLS tool.

Apart from random graphs, the algorithm can be tested for the SGB128 (North American cities) dataset created by Stanford. To visualize the solution, run the notebook.

Contributing

Contributions are what make the open source community such an amazing place to be, learn, inspire, and create.
Contribute following the above steps:

1. Fork the Project
2. Create your Feature Branch (git checkout -b new_branch_name)
3. Commit your Changes (git commit -m 'Add some extra functionality')
4. Push to the Branch (git push origin new_branch_name)
5. Open a Pull Request