Traveling Salesman Problem + Python
Download source code @ https://sites.fastspring.com/prototypeprj/instant/ai
Traveling Salesman Problem + Python + Brute Force
public version (demo only) | members-only version (demo, write, and test run)
Download source code @ https://sites.fastspring.com/prototypeprj/instant/ai
Brute Force Algorithm used here to solve TSP
Each city is identified by its latitude & longitude coordinates
Haversine formula used for calculating distances between cities
Traveling Salesman Problem + Python + Genetic Algorithm
public version (demo only) | members-only version (demo, write, and test run)
Download source code @ https://sites.fastspring.com/prototypeprj/instant/ai
Genetic Algorithm used here to solve TSP
Each city is identified by its latitude & longitude coordinates
Haversine formula used for calculating distances between cities
Traveling Salesman Problem + Python + Hill Climbing
public version (demo only) | members-only version (demo, write, and test run)
Download source code @ https://sites.fastspring.com/prototypeprj/instant/ai
Hill Climbing Algorithm used here to solve TSP
Each city is identified by its latitude & longitude coordinates
Haversine formula used for calculating distances between cities
Traveling Salesman Problem + Python + Simulated Annealing
public version (demo only) | members-only version (demo, write, and test run)
Download source code @ https://sites.fastspring.com/prototypeprj/instant/ai
Simulated Annealing Algorithm used here to solve TSP
Each city is identified by its latitude & longitude coordinates
Haversine formula used for calculating distances between cities
Traveling Salesman Problem + Python + Nearest Neighbor
public version (demo only) | members-only version (demo, write, and test run)
Download source code @ https://sites.fastspring.com/prototypeprj/instant/ai
Nearest Neighbor Algorithm used here to solve TSP
Each city is identified by its latitude & longitude coordinates
Haversine formula used for calculating distances between cities