Traveling-Saleman-Genetic-Algorithm

Solving the Traveling Salesman problem with 49 US Capitals using a genetic algorithm

This solver utilizes several Google Map APIs:

Capitals are converted into geolocations using the Geocoding API.
The Distance Matrix API is used in order to calculate driving time between each pair of capitals.
The Directions API is used to get the paths of the fastest routes between cities.
Lastly, the Static Maps API is used to draw the full solution and cities on a map and save it to disk.

Name	Name	Last commit message	Last commit date
Latest commit jmhummel MAX_DURATION should by default be 0 Oct 13, 2017 d50dd28 · Oct 13, 2017 History 6 Commits
.gitignore	.gitignore	Initial commit	Apr 4, 2017
LICENSE	LICENSE	Initial commit	Apr 4, 2017
README.md	README.md	Added image to README	Apr 5, 2017
cache.p	cache.p	Initial commit	Apr 4, 2017
config.yml	config.yml	Initial commit	Apr 4, 2017
createCache.py	createCache.py	Initial commit	Apr 4, 2017
createDirectionsCache.py	createDirectionsCache.py	Initial commit	Apr 4, 2017
createGeoCache.py	createGeoCache.py	Initial commit	Apr 4, 2017
createMap.py	createMap.py	Initial commit	Apr 4, 2017
directions.p	directions.p	Initial commit	Apr 4, 2017
geoCache.p	geoCache.p	Initial commit	Apr 4, 2017
gmap-plot.py	gmap-plot.py	Initial commit	Apr 4, 2017
gmap-stats.py	gmap-stats.py	Initial commit	Apr 4, 2017
imagesToGif.py	imagesToGif.py	Initial commit	Apr 4, 2017
index.py	index.py	MAX_DURATION should by default be 0	Oct 13, 2017
map.p	map.p	Initial commit	Apr 4, 2017
maputils.py	maputils.py	Initial commit	Apr 4, 2017
plot.py	plot.py	Initial commit	Apr 4, 2017
requirements.txt	requirements.txt	Initial commit	Apr 4, 2017

Provide feedback