Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Ismkhan, Hassan"'
Autor:
Ismkhan, Hassan, Izadi, Mohammad
Publikováno v:
In Information Sciences December 2022 618:298-316
Autor:
Ismkhan, Hassan
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 sensitive for initial centers (seeds). This paper proposed a method for i
Externí odkaz:
http://arxiv.org/abs/1705.03613
Autor:
Ismkhan, Hassan, Zamanifar, Kamran
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 Crossover and mutation operators are two important elements of GA. There are
Externí odkaz:
http://arxiv.org/abs/1504.02590
Autor:
Ismkhan, Hassan
Ant Colony Algorithm (ACA) and Genetic Local Search (GLS) are two optimization algorithms that have been successfully applied to the Traveling Salesman Problem (TSP). In this paper we define new crossover operator then redefine ACAs ants as operate a
Externí odkaz:
http://arxiv.org/abs/1411.3277
Autor:
Ismkhan, Hassan
This paper research review Ant colony optimization (ACO) and Genetic Algorithm (GA), both are two powerful meta-heuristics. This paper explains some major defects of these two algorithm at first then proposes a new model for ACO in which, artificial
Externí odkaz:
http://arxiv.org/abs/1411.2897
Autor:
Ismkhan, Hassan, Zamanifar, Kamran
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 resolved by Genetic Algorithm (GA). Researchers have proposed several ve
Externí odkaz:
http://arxiv.org/abs/1209.5339
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.