9 citations · 11 across the 3 of their papers we have counts for
3 papers
cs.LG2017★ 2 cited
An initialization method for the k-means using the concept of useful nearest centers
Hassan Ismkhan
The aim of the k-means is to minimize squared sum of Euclidean distance from the mean (SSEDM) of each cluster. The k-means can effectively optimize this function, but it is too sen…
cs.NE2015
Study of Some Recent Crossovers Effects on Speed and Accuracy of Genetic Algorithm, Using Symmetric Travelling Salesman Problem
Hassan Ismkhan, Kamran Zamanifar
The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is one of metaheuristics that have been applied to TSP. The Crosso…
cs.NE2012★ 9 cited
Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem
Hassan Ismkhan, Kamran Zamanifar
The Traveling Salesman Problem (TSP) is one of the most famous optimization problems. Greedy crossover designed by Greffenstette et al, can be used while Symmetric TSP (STSP) is re…