Skip to content

AhemdMahmoud/Solving_TSP_using_GA

View on GitHub ↗Related repositories →

This project aims to solve the Traveling Salesman Problem (TSP) using a Genetic Algorithm. The TSP involves finding the shortest possible route that visits a set of locations (in this case, Egyptian governorates) and returns to the starting location. We'll apply this algorithm to help Sabry's Dialy, an Egyptian YouTuber, find the closest road betwe

active 2023-09-172023-12-27 (UTC)

Complete coverage26,566 / 26,566 hourly files (100%) · 2 absent upstream2023-08-152026-08-25 (UTC)
Events
8
Pushes
3
Pull requests
0
Issues
0
Stars
4
Forks
1

Activity over time

Daily event counts in the loaded window

Line chart, 102 days from 2023-09-17 to 2023-12-27. Pushes: 3 total, peak 3 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: 4 total, peak 2 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

ContributorContributionsPushesPRsComments
AhemdMahmoud3300

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 — 4 stars here means stars gained during the window, not the repo's star count.