Ant-Colony-Optimization-for-the-Traveling-Salesman-Problem
A population based stochastic algorithm for solving the Traveling Salesman Problem.
- 26
- Java
- 10 y ago
A population based stochastic algorithm for solving the Traveling Salesman Problem.
A color palette/gradient reader/writer for a growing set of file formats. Swift (macOS, iOS, tvOS, watchoOS, macCatalyst, Linux)
A full-stack (R&D) Vehicle Routing Problem with Time Windows (VRPTW) comparison platform. Run and benchmark metaheuristic algorithms HGS, ACO, SA, GLS (v0.6.3) & ILS (v0.13+), visualize routes, tune parameters, and explore Solomon benchmark datasets—with an optional AI-assisted RAG Q&A and parameter tuning capabilities.
Ant Colony Optimization (ACO) for travelling salesperson problem (TSP) and combinatorial path routing.