Algorithms with greedy heuristic procedures for mixture probability distribution separation
For clustering problems based on the model of mixture probability distribution separation, we propose quest fryer new Variable Neighbourhood Search algorithms (VNS) and evolutionary genetic algorithms (GA) with greedy agglomerative heuristic procedures and compare them with known algorithms.New genetic algorithms implement a global search strategy