From 4ec0713a03c93caa79401d14546c81a0de0879aa Mon Sep 17 00:00:00 2001 From: minto Date: Sat, 24 Feb 2018 12:44:52 +0100 Subject: [PATCH] update readme --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 71098dc..9d6563e 100644 --- a/README.md +++ b/README.md @@ -7,7 +7,7 @@ It provides a geographical step-by-step visualization of each of these algorithm ![pyTSP](readme/intro.gif) -**You can find a demo of pyTSP on a small graph made of all U.S cities with a population larger than 800 000 inhabitants. _[here](http://google.com/)_ !** +**You can find a _[demo of pyTSP here !](http://mintoo.pythonanywhere.com/)_ ** (U.S cities with a population larger than 900 000 inhabitants) # Algorithms @@ -125,7 +125,7 @@ a valid tour. If this new tour is shorter, make the change. pyTSP implements a genetic algorithm with the following properties: - 3 mutation methods: random swap, insertion or displacement. -- 3 crossover methods: order, maximally preservation, or partially mapped. +- 3 crossover methods: order, maximally preservative, or partially mapped. - Selection: at each generation, 30 individuals are chosen randomly, and the 10 best are kept for the next generation. - Mutation and crossover rates default to 50%. They can be modified with sliders.