Sort by:

• Highly Influential Citations
• Citations
• Acceleration
• Velocity
• Recency

Learn More

Effective heuristics for ant colony optimization to handle large-scale problems

• Hassan Ismkhan
• Swarm and Evolutionary Computation
• 2017

Although ant colony optimization (ACO) has successfully been applied to a wide range of optimization problems, its high timeand space-complexity prevent it to be applied to the large-scale instances.… (More)

Black box optimization using evolutionary algorithm with novel selection and replacement strategies based on similarity between solutions

• Hassan Ismkhan
• 2018

Using ants as a genetic crossover operator in GLS to solve STSP

• Hassan Ismkhan
• 2010 International Conference of Soft Computing…
• 2010

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… (More)

Accelerating the ANT Colony Optimization By Smart ANTs, Using Genetic Operator

• Hassan Ismkhan
• ArXiv
• 2014

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… (More)

A.1D-C: A novel fast automatic heuristic to handle large-scale one-dimensional clustering

• Hassan Ismkhan
• 2017

Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages

• Hassan Ismkhan, Kamran Zamanifar
• Applied Comp. Int. Soft Computing
• 2014

Effective three-phase evolutionary algorithm to handle the large-scale colorful traveling salesman problem

• Hassan Ismkhan
• 2017

A Novel Fast Heuristic to Handle Large-Scale Shape Clustering

• Hassan Ismkhan
• 2014

Clustering algorithms like types of k-means are fast, but they are inefficient for shape clustering. There are some algorithms, which are effective, but their time complexities are too high. This… (More)

Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem

• Hassan Ismkhan, Kamran Zamanifar
• ArXiv
• 2012

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… (More)

I-k-means-+: An iterative clustering algorithm based on an enhanced version of the k-means

• Hassan Ismkhan
• Pattern Recognition
• 2018

• ‹
• 1
• 2
• ›