mbalchanowski/Ant-Colony-System
Simple console implementation of the Ant Colony System (ACS) algorithm
This console tool helps you find the shortest route for a delivery or travel schedule. You input a list of cities and their locations, typically in a standard format like a .tsp file, and it outputs the most efficient sequence to visit all of them. Anyone needing to optimize routes, such as logistics planners or operations researchers, would find this useful.
No commits in the last 6 months.
Use this if you need to solve the Traveling Salesperson Problem for a defined set of locations and want to explore solutions using an Ant Colony System algorithm.
Not ideal if you need a graphical interface, real-time routing with dynamic conditions, or solutions for problems beyond the standard Traveling Salesperson Problem.
Stars
10
Forks
4
Language
C#
License
MIT
Category
Last pushed
Jun 03, 2018
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/agents/mbalchanowski/Ant-Colony-System"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.