diff --git a/algorithms/trip_farthest_insertion.hpp b/algorithms/trip_farthest_insertion.hpp
index e1f18ee33..91f0aa417 100644
--- a/algorithms/trip_farthest_insertion.hpp
+++ b/algorithms/trip_farthest_insertion.hpp
@@ -125,7 +125,7 @@ std::vector<NodeID> FindRoute(const std::size_t &number_of_locations,
     for (std::size_t j = 2; j < component_size; ++j)
     {
 
-        auto farthest_distance = -std::numeric_limits<int>::max();
+        auto farthest_distance = std::numeric_limits<int>::min();
         auto next_node = -1;
         NodeIDIter next_insert_point;