Ant Colony Optimization with Dual Pheromone Table for Clustering
碩士 === 國立中山大學 === 資訊工程學系研究所 === 99 === This thesis presents a novel algorithm called ant colony optimization with dual pheromone tables (ACODPT) for improving the quality of ant colony optimization (ACO). The proposed algorithm works by adding a so-called “negative” pheromone table to ACO to avoid t...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/44732787136252862938 |
id |
ndltd-TW-099NSYS5392067 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-099NSYS53920672015-10-19T04:03:35Z http://ndltd.ncl.edu.tw/handle/44732787136252862938 Ant Colony Optimization with Dual Pheromone Table for Clustering 以雙重費洛蒙表格之螞蟻群聚最佳化解決分群問題 Kai-Cheng Hu 胡開程 碩士 國立中山大學 資訊工程學系研究所 99 This thesis presents a novel algorithm called ant colony optimization with dual pheromone tables (ACODPT) for improving the quality of ant colony optimization (ACO). The proposed algorithm works by adding a so-called “negative” pheromone table to ACO to avoid the problem of ACO easily falling into local optima. By using the “negative” pheromone table to eliminate the most impossible path to search for the new solution, the probability of selecting the remaining paths is increased, and so is the quality. To evaluate the performance of the proposed algorithm, ACODPT is compared with several state-of-the-art algorithms in solving the clustering problem. The experimental results show that the proposed algorithm can eventually prevent ACO from falling into local optima in the early iterations, thus providing a better result than the other algorithms in many cases. Ming-Chao Chiang 江明朝 2011 學位論文 ; thesis 44 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中山大學 === 資訊工程學系研究所 === 99 === This thesis presents a novel algorithm called ant colony optimization with dual pheromone tables
(ACODPT) for improving the quality of ant colony optimization (ACO). The proposed
algorithm works by adding a so-called “negative” pheromone table to ACO to avoid the problem
of ACO easily falling into local optima. By using the “negative” pheromone table to
eliminate the most impossible path to search for the new solution, the probability of selecting
the remaining paths is increased, and so is the quality. To evaluate the performance of the proposed
algorithm, ACODPT is compared with several state-of-the-art algorithms in solving the
clustering problem. The experimental results show that the proposed algorithm can eventually
prevent ACO from falling into local optima in the early iterations, thus providing a better result
than the other algorithms in many cases.
|
author2 |
Ming-Chao Chiang |
author_facet |
Ming-Chao Chiang Kai-Cheng Hu 胡開程 |
author |
Kai-Cheng Hu 胡開程 |
spellingShingle |
Kai-Cheng Hu 胡開程 Ant Colony Optimization with Dual Pheromone Table for Clustering |
author_sort |
Kai-Cheng Hu |
title |
Ant Colony Optimization with Dual Pheromone Table for Clustering |
title_short |
Ant Colony Optimization with Dual Pheromone Table for Clustering |
title_full |
Ant Colony Optimization with Dual Pheromone Table for Clustering |
title_fullStr |
Ant Colony Optimization with Dual Pheromone Table for Clustering |
title_full_unstemmed |
Ant Colony Optimization with Dual Pheromone Table for Clustering |
title_sort |
ant colony optimization with dual pheromone table for clustering |
publishDate |
2011 |
url |
http://ndltd.ncl.edu.tw/handle/44732787136252862938 |
work_keys_str_mv |
AT kaichenghu antcolonyoptimizationwithdualpheromonetableforclustering AT húkāichéng antcolonyoptimizationwithdualpheromonetableforclustering AT kaichenghu yǐshuāngzhòngfèiluòméngbiǎogézhīmǎyǐqúnjùzuìjiāhuàjiějuéfēnqúnwèntí AT húkāichéng yǐshuāngzhòngfèiluòméngbiǎogézhīmǎyǐqúnjùzuìjiāhuàjiějuéfēnqúnwèntí |
_version_ |
1718094097370054656 |