diff --git a/WHATS_NEW.md b/WHATS_NEW.md
index 447745e9..09a7587d 100644
--- a/WHATS_NEW.md
+++ b/WHATS_NEW.md
@@ -25,7 +25,7 @@ This is definitely not the intuitive solution, one would expect when looking at
 
 Therefore, we put much effort into analysing this and designing a new algorithm (which is still based on the
 schrimpf principles). We implemented two new ruin strategies: worst and cluster ruin, and we added
-noise to the ruin and recreation strategies. Moreover, the new algorithm makes use of regretInsertion by default.
+some randomness to the ruin and recreation strategies. Moreover, the new algorithm makes use of regretInsertion by default.
 On all benchmarking instances, our new algorithm performs better (or at least as good
  as) than the previous algorithms in terms of solution quality. However, it comes with higher computational costs.
 Look at how the new algorithm solves the above problem