TSP Route Optimization

This project optimizes machine visitation routes with a clustering + genetic approach.

Algorithm Steps

1. Start with all machines.
2. Run DBSCAN to group nearby machines into clusters.
3. Apply GA clustering to shape routes close to 8 hours.
4. For each cluster, run a genetic TSP solver to optimize visit order.
5. Iterate until convergence and keep the best route per cluster.

Genetic Solver (Per Cluster)

1. Generate an initial population by shuffling machine order.
2. Evaluate fitness (opportunity cost + time/distance cost).
3. Keep top individuals (elitism).
4. Create children with crossover and mutation.
5. Repeat for N iterations and return the best route.