Skip to content

TSP solving algorithm for multiple travelers using G.A. with some intutive algorithm approach

Notifications You must be signed in to change notification settings

myaldiz/Clustermatic

Repository files navigation

Clustermatic

TSP solving algorithm for multiple travelers using Genetic Algorithm.

For dividing cities to travelers, k-means algorithm used with small differences to original one. Within cities, Genetic Algorithm used to solve Tsp, but instead of random created solutions at the beginning, we choose to create them with some intution.

About

TSP solving algorithm for multiple travelers using G.A. with some intutive algorithm approach

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published