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...
保存先:
主要な著者: | Jabbar, Ayad Mohammed, Ku-Mahamud, Ku Ruhana, Sagban, Rafid |
---|---|
フォーマット: | 論文 |
言語: | 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, 等
出版事項: (2020) -
Balancing exploration and exploitation in ACS algorithms for data clustering
著者:: Jabbar, Ayad Mohammed, 等
出版事項: (2019) -
Ant-based sorting and ACO-based clustering approaches: A review
著者:: Jabbar, Ayad Mohammed, 等
出版事項: (2018) -
Reactive max-min ant system with recursive local search and its application to TSP and QAP
著者:: Sagban, Rafid, 等
出版事項: (2016) -
Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches
著者:: Sagban, Rafid, 等
出版事項: (2015)