In this project, we employed bioinspired algorithms to solve the classic Traveling Salesman Problem (TSP) and compared their performance to an exact optimization model. The TSP is an NP-hard problem where the objective is to find the shortest possible route visiting all nodes exactly once. We focused on networks ranging from 40 to 200 nodes.
active 2024-12-04 → 2025-01-11 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 39 days from 2024-12-04 to 2025-01-11. Pushes: 2 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| DiegoA-ML | 2 | 2 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.