no code implementations • 10 May 2017 • Hassan Ismkhan
The aim of the k-means is to minimize squared sum of Euclidean distance from the mean (SSEDM) of each cluster.
no code implementations • 10 Apr 2015 • Hassan Ismkhan, Kamran Zamanifar
The Travelling Salesman Problem (TSP) is one of the most famous optimization problems.
no code implementations • 12 Nov 2014 • Hassan Ismkhan
Ant Colony Algorithm (ACA) and Genetic Local Search (GLS) are two optimization algorithms that have been successfully applied to the Traveling Salesman Problem (TSP).
no code implementations • 11 Nov 2014 • Hassan Ismkhan
This paper research review Ant colony optimization (ACO) and Genetic Algorithm (GA), both are two powerful meta-heuristics.