diff --git a/src/algorithms/ant_colony.cpp b/src/algorithms/ant_colony.cpp
index cb4bbbe..415fff5 100644
--- a/src/algorithms/ant_colony.cpp
+++ b/src/algorithms/ant_colony.cpp
@@ -150,7 +150,6 @@ CvrpSolution antColonyOptimization(const CvrpInstance& instance, size_t maxItera
 
             if (solution.length < bestSolution.length) {
                 bestSolution = solution;
-                cout << "[ITER. " << iter << "] New best solution: " << solution.length / 1000 << "km." << endl;
             }
 
             for (const auto& route : solution.routes) {
diff --git a/src/algorithms/tabu_search.cpp b/src/algorithms/tabu_search.cpp
index 5140f49..25937d7 100644
--- a/src/algorithms/tabu_search.cpp
+++ b/src/algorithms/tabu_search.cpp
@@ -432,10 +432,6 @@ CvrpSolution granularTabuSearch(const CvrpInstance& instance, size_t maxIteratio
             tabuList[edge] = tenureDistribution(rng);
         }
 
-        cout << "[ITER. " << iter << "] Evaluated " << movesEvaluated
-            << " moves, best non-tabu route has length " << iterationBest->length / 1000
-            << "km" << endl;
-
         currentSolution = move(*iterationBest);
 
         if (iter % PENALTY_UPDATE_ITERS == 0) {
@@ -451,8 +447,5 @@ CvrpSolution granularTabuSearch(const CvrpInstance& instance, size_t maxIteratio
         }
     }
 
-    cout << "Best solution found by algorithm has length " << bestSolution.length / 1000
-        << "km" << endl;
-
     return bestSolution.toStandardForm();
 }