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 |
---|---|
格式: | Article |
语言: | English |
出版: |
Science Publications
2019
|
主题: | |
在线阅读: | 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 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
An improved ACS algorithm for data clustering
由: Mohammed Jabbar, Ayad, et al.
出版: (2020) -
Balancing exploration and exploitation in ACS algorithms for data clustering
由: Jabbar, Ayad Mohammed, et al.
出版: (2019) -
Ant-based sorting and ACO-based clustering approaches: A review
由: Jabbar, Ayad Mohammed, et al.
出版: (2018) -
Reactive max-min ant system with recursive local search and its application to TSP and QAP
由: Sagban, Rafid, et al.
出版: (2016) -
Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches
由: Sagban, Rafid, et al.
出版: (2015)