From: Skullheadx <704277@pdsb.net>
Date: Mon, 9 Jan 2023 02:29:35 +0000 (-0500)
Subject: Update README.md
X-Git-Url: http://git.skullheadx.com/index.css?a=commitdiff_plain;h=c50129a998d391c250a6814a9798582a7eac9e69;p=The-Traveling-Salesman-Problem.git

Update README.md
---

diff --git a/README.md b/README.md
index f4a667e..0c71d09 100644
--- a/README.md
+++ b/README.md
@@ -100,3 +100,17 @@ The Christofides Algorithm creates a tour by:
 5. Construct a TSP tour by going through the Eulerian tour and when we encounter a node we have already visited, simply skip over it and connect the previous node to the next one that has not been visited yet.
 
 --------------------------------------------------------------------------------------------------------------
+
+**Tour Improvement**
+
+Typically, the heuristic solutions can generate a decent solution to the TSP, but they are often constricted simply by the idea that defines them.
+Take this graph for instance, generated by the Christofides Algorithm.  
+
+![](Christofides_bad.png)
+
+If you notice the edge between (273, 269) and (334,510) and the edge between (263, 392) and (510, 143). They cross each other and it would probably be a better solution if they connected differently.
+This method of improving a candidate solution created by a heuristic is called local search.
+--------------------------------------------------------------------------------------------------------------
+
+**Random Swapping**
+