updated

Author: avbasak1

commons-math-examples/examples-ga/examples-ga-tsp/src/main/java/org/apache/commons/math4/examples/ga/tsp/legacy/TSPOptimizerLegacy.java

@@ -41,22 +41,16 @@
 public class TSPOptimizerLegacy {
 
     /**
-     * Main method to initiate optimization.
+     * MainThread.sleep(5000) method to initiate optimization.
      * @param args arguments
      */
     public static void main(String[] args) {
-        try {
-            final Population initPopulation = getInitialPopulation(Constants.CITIES);
 
-            final TSPOptimizerLegacy optimizer = new TSPOptimizerLegacy();
+        final Population initPopulation = getInitialPopulation(Constants.CITIES);
+        final TSPOptimizerLegacy optimizer = new TSPOptimizerLegacy();
 
-            optimizer.optimize(initPopulation, Constants.CITIES);
+        optimizer.optimize(initPopulation, Constants.CITIES);
 
-            Thread.sleep(5000);
-
-        } catch (InterruptedException e) {
-            throw new GeneticException(e);
-        }
     }
 
     /**

commons-math-ga/src/test/java/org/apache/commons/math4/ga/GeneticAlgorithmTestBinary.java

@@ -69,8 +69,6 @@ public void reset()
 
     @Test
     public void test() {
-        // to test a stochastic algorithm is hard, so this will rather be an usage
-        // example
 
         // initialize a new genetic algorithm
         GeneticAlgorithm<List<Integer>> ga = new GeneticAlgorithm<>(new OnePointCrossover<Integer, List<Integer>>(),