NP-hard. This is a solution to NP-hard problems represented by TSP. Interestingly, we just chose three optimization algorithms of different dimensions: genetic algorithms represented by traditional GA, evolutionary algorithms represented by DE, and swarm intelligence algorithms represented by TSP.

github.com/Selen-Suyue/NP-hard

Vaya's read on this project

Problem, audience, market, and the verdict — sign in to see it.

Updates

No recent activity.