Adaptive elitist-ant system for medical clustering problem
In general, population based algorithms are superior to local search based algorithms in term of exploration the search space. In any case, the primary downside in different population based algorithms is in exploiting the search space. Recently, a Hybrid Elitist ant system approach is considered as...
Main Author: | Anmar F. Abuhamdah |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2020-07-01
|
Series: | Journal of King Saud University: Computer and Information Sciences |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S131915781830257X |
Similar Items
-
Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem
by: MARTINOVIC, G., et al.
Published: (2012-02-01) -
A Polymorphic Ant-Based Algorithm for Graph Clustering
by: Liu, Ying Ying, et al.
Published: (2016) -
Experimental Analysis of Ant System on Travelling Salesman Problem Dataset TSPLIB
by: Kalaipriyan Thirugnanasambandam, et al.
Published: (2019-08-01) -
Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
by: Fadl Dahan, et al.
Published: (2019-04-01) -
Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem
by: Murilo Falleiros Lemos Schmitt, et al.
Published: (2020-02-01)