Modified ACS centroid memory for data clustering
Ant Colony Optimization (ACO) is a generic algorithm, which has been widely used in different application domains due to its simplicity and adaptiveness to different optimization problems. The key component that governs the search process in this algorithm is the management of its memory model. In...
Saved in:
Main Authors: | Jabbar, Ayad Mohammed, Ku-Mahamud, Ku Ruhana, Sagban, Rafid |
---|---|
Format: | Article |
Language: | English |
Published: |
Science Publications
2019
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/27858/1/jcssp%2015%2010%202019%201439%201449.pdf http://repo.uum.edu.my/27858/ http://doi.org/10.3844/jcssp.2019.1439.1449 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An improved ACS algorithm for data clustering
by: Mohammed Jabbar, Ayad, et al.
Published: (2020) -
Balancing exploration and exploitation in ACS algorithms for data clustering
by: Jabbar, Ayad Mohammed, et al.
Published: (2019) -
Ant-based sorting and ACO-based clustering approaches: A review
by: Jabbar, Ayad Mohammed, et al.
Published: (2018) -
Reactive max-min ant system with recursive local search and its application to TSP and QAP
by: Sagban, Rafid, et al.
Published: (2016) -
Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches
by: Sagban, Rafid, et al.
Published: (2015)