Experimental: initial shared global optimum in TS

Graph.cpp

 #include <queue>
 #include <random>
 #include <thread>
-
 #include <iostream>
 
 Graph::Graph()
     std::default_random_engine randomGen(randomSrc());
     std::uniform_int_distribution<> vertexDist(0, graph.vertexNumber - 1);
 
+    std::mutex globalOptimumMutex;
+    unsigned globalOptimum = -1;
+
     // Petla uruchamiajaca watki
     for(int i = 0; i < threadsNumber; i++)
     {
         }
 
         // Uruchomienie watku
-        threadsVector.push_back(std::thread(Graph::travellingSalesmanTabuSearchEngine, std::ref(graph), tabuSteps, diversification, iterationsToRestart, minStopTime, startRoute, std::ref(resultsVector.at(i)), std::ref(resultsLength.at(i))));
+        threadsVector.push_back(std::thread(Graph::travellingSalesmanTabuSearchEngine, std::ref(graph), tabuSteps, diversification, iterationsToRestart, minStopTime, startRoute, std::ref(resultsVector.at(i)), std::ref(resultsLength.at(i)), std::ref(globalOptimum), std::ref(globalOptimumMutex)));
     }
 
     // Petla potwierdzajaca zakonczenie watkow
     return optimalResult;
 }
 
-void Graph::travellingSalesmanTabuSearchEngine(Graph &graph, unsigned tabuSteps, bool diversification, int iterationsToRestart, unsigned minStopTime, std::vector<unsigned> startRoute, std::vector<unsigned> &result, int &resultLength)
+void Graph::travellingSalesmanTabuSearchEngine(Graph &graph, unsigned tabuSteps, bool diversification, int iterationsToRestart, unsigned minStopTime, std::vector<unsigned> startRoute, std::vector<unsigned> &result, int &resultLength, unsigned &globalOptimum, std::mutex &globalOptimumMutex)
 {
     // ALGORYTM oparty na metaheurystyce tabu search z dywersyfikacja i sasiedztwem typu swap
     // Rdzen przeznaczony do uruchamiania jako jeden watek
             // PEA 2 Plus
             // Jan Potocki 2019
 
-            if(optimalRouteLength == -1)
+            globalOptimumMutex.lock();
+            if(globalOptimum == -1)
             {
-                optimalRouteLength = nextRouteLength;
+                globalOptimum = nextRouteLength;
                 optimalRoute = nextRoute;
 
                 // Reset licznika
                 stopCounter = 0;
+
+                std::cout << "Nowa najlepsza trasa: " << globalOptimum << std::endl;
             }
-            else if(optimalRouteLength > nextRouteLength)
+            else if(globalOptimum > nextRouteLength)
             {
-                optimalRouteLength = nextRouteLength;
+                globalOptimum = nextRouteLength;
                 optimalRoute = nextRoute;
 
                 // Zaplanowanie intensyfikacji przy znalezieniu nowego optimum
 
                 // Reset licznika
                 stopCounter = 0;
+
+                std::cout << "Nowa najlepsza trasa: " << globalOptimum << std::endl;
             }
+            globalOptimumMutex.unlock();
 
             // Weryfikacja listy tabu...
             int tabuPos = 0;
             while(tabuPos < tabuArray.size())
-            {   
+            {
                 // ...aktualizacja kadencji na liscie tabu
                 tabuArray.at(tabuPos).at(0)--;
-                
+
                 //...usuniecie zerowych kadencji
                 if(tabuArray.at(tabuPos).at(0) == 0)
                     tabuArray.erase(tabuArray.begin() + tabuPos);

Graph.h

 #ifndef GRAPH_H
 #define GRAPH_H
 #include <vector>
+#include <mutex>
 
 
 class Graph
         unsigned vertexNumber;
 
     private:
-        static void travellingSalesmanTabuSearchEngine(Graph &graph, unsigned tabuSteps, bool diversification, int iterationsToRestart, unsigned minStopTime, std::vector<unsigned> startRoute, std::vector<unsigned> &result, int &resultLength);
+        static void travellingSalesmanTabuSearchEngine(Graph &graph, unsigned tabuSteps, bool diversification, int iterationsToRestart, unsigned minStopTime, std::vector<unsigned> startRoute, std::vector<unsigned> &result, int &resultLength, unsigned &globalOptimum, std::mutex &globalOptimumMutex);
 
         class RouteComparison
         {