https://github.com/jackkimmins/webpathfinder
C++ WASM Solver for TSP w/ Hybrid Genetic Algorithm
https://github.com/jackkimmins/webpathfinder
bootstrap5 combinatorial-optimization cpp genetic-algorithm webassembly
Last synced: about 1 year ago
JSON representation
C++ WASM Solver for TSP w/ Hybrid Genetic Algorithm
- Host: GitHub
- URL: https://github.com/jackkimmins/webpathfinder
- Owner: jackkimmins
- Created: 2023-12-03T09:56:31.000Z (over 2 years ago)
- Default Branch: master
- Last Pushed: 2025-01-12T09:05:27.000Z (about 1 year ago)
- Last Synced: 2025-02-01T06:15:39.710Z (about 1 year ago)
- Topics: bootstrap5, combinatorial-optimization, cpp, genetic-algorithm, webassembly
- Language: C++
- Homepage: https://webpathfinder.appserver.uk
- Size: 1.78 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README

# Traveling Salesman Problem Solver Using a Genetic Algorithm in C++ WebAssembly
This project is a C++ WebAssembly (WASM) implementation of a solver for the Traveling Salesman Problem (TSP) using a genetic algorithm. The solver is designed to find an approximate solution to the TSP, which involves finding the shortest possible route that visits a list of cities and returns to the origin city. The project showcases how complex algorithms can be efficiently implemented and executed in a web environment using WebAssembly.
The TSP is a well-known combinatorial optimisation problem. It poses a significant challenge due to its NP-hard nature, meaning that no known algorithm can solve all instances of the problem quickly (in polynomial time).
## Summary of GA

## Demo Site
Please view demonstration site: [https://webpathfinder.appserver.uk/](https://webpathfinder.appserver.uk/)
## Examples
