國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

多子族群螞蟻演算法遷徙效能之研究 = A Study on the Pe...

國立高雄大學資訊工程學系碩士班

多子族群螞蟻演算法遷徙效能之研究 = A Study on the Performance of Migration in Multiple Sub-Ant Colonies

紀錄類型:	書目-語言資料,印刷品 : 單行本
並列題名:	A Study on the Performance of Migration in Multiple Sub-Ant Colonies
作者:	黃齡儀,
其他團體作者:	國立高雄大學
出版地:	[高雄市]
出版者:	撰者;
出版年:	2014[民103]
面頁冊數:	118葉部分彩圖,表 : 30公分;
標題:	仿生計算
標題:	Bio-inspired Computation
電子資源:	https://hdl.handle.net/11296/5pqvgu
附註:	108年10月31日公開
附註:	參考書目：葉103-106
摘要註:	仿生計算源自生物本能並且廣泛的運用在提升問題的執行效能上。目前此領域已經有許多方法被提出，其中螞蟻演算法在解決最佳化問題上有著很好的表現。在此論文我們將會討論螞蟻族群分群對效能的影響以及研究其間的遷徙機制。大多數研究中分群內的螞蟻數量與傳統演算法設定相同，在這論文中我們著重討論螞蟻總數切割並平均分攤後的影響。我們首先提出不包含遷徙機制的分群架構，實驗結果顯示出適當的螞蟻分群可以提高搜尋時的多樣性並能改善解答的品質。根據此特性，我們進而設計主從架構下的平行演算法以增進執行時的速率。我們接著提出數種遷徙方式的子螞蟻族群演算法，討論了固定與動態調整遷徙參數的不同做法。最後實驗結果顯示出所提的方法在子螞蟻族群遷徙的交互影響下可以得到更好的效果。 Bio-inspired computation is a new field derived from the behavior of living things and has been widely applied to speed up the execution of a variety of applications. There have been many approaches proposed in the field, and among them the ant colony system gets good solutions for optimization problems. In the past, the approaches for parallel runs or multiple colonies usually set the ant number in each run or each colony is the same as that in sequential ant colony optimization. In this thesis, we assume the total numbers of ants in both the sequential and the parallel processing are the same. We discuss the effects of dividing an ant colony into several groups on performance and study the migration mechanism among them. First, the sub-ant-colony scheme without migration is designed and experiments show the division of an ant colony can increase the diversity of search and thus improve the solution quality. A parallel algorithm based on the property is then proposed to speed up the execution. Next, several sub-ant-colony algorithms with different migration strategies are proposed. Especially, fixed and dynamic parameter adjustments are adopted, respectively. Experiments show that the proposed algorithms with migration can benefit from the interaction of the sub-ant-colonies.

多子族群螞蟻演算法遷徙效能之研究 = A Study on the Performance of Migration in Multiple Sub-Ant Colonies
黃, 齡儀

多子族群螞蟻演算法遷徙效能之研究 = A Study on the Performance of Migration in Multiple Sub-Ant Colonies / 黃齡儀撰 - [高雄市] : 撰者, 2014[民103]. - 118葉 ; 部分彩圖,表 ; 30公分.
108年10月31日公開參考書目：葉103-106.
仿生計算Bio-inspired Computation

多子族群螞蟻演算法遷徙效能之研究 = A Study on the Performance of Migration in Multiple Sub-Ant Colonies
LDR:03449nam0a2200277 450 001 430151
005 20191119095131.0
010 0 $b 精裝
010 0 $b 平裝
100 $a 20141027y2014 k y0chiy50 e
101 0 $a eng $d chi $d eng
102 $a tw
105 $a ak am 000yy
200 1 $a 多子族群螞蟻演算法遷徙效能之研究 $d A Study on the Performance of Migration in Multiple Sub-Ant Colonies $z eng $f 黃齡儀撰
210 $a [高雄市] $c 撰者 $d 2014[民103]
215 0 $a 118葉 $c 部分彩圖,表 $d 30公分
300 $a 108年10月31日公開
300 $a 參考書目：葉103-106
314 $a 指導教授：洪宗貝博士、林文揚博士
328 $a 碩士論文--國立高雄大學資訊工程學系碩士班
330 $a 仿生計算源自生物本能並且廣泛的運用在提升問題的執行效能上。目前此領域已經有許多方法被提出，其中螞蟻演算法在解決最佳化問題上有著很好的表現。在此論文我們將會討論螞蟻族群分群對效能的影響以及研究其間的遷徙機制。大多數研究中分群內的螞蟻數量與傳統演算法設定相同，在這論文中我們著重討論螞蟻總數切割並平均分攤後的影響。我們首先提出不包含遷徙機制的分群架構，實驗結果顯示出適當的螞蟻分群可以提高搜尋時的多樣性並能改善解答的品質。根據此特性，我們進而設計主從架構下的平行演算法以增進執行時的速率。我們接著提出數種遷徙方式的子螞蟻族群演算法，討論了固定與動態調整遷徙參數的不同做法。最後實驗結果顯示出所提的方法在子螞蟻族群遷徙的交互影響下可以得到更好的效果。 Bio-inspired computation is a new field derived from the behavior of living things and has been widely applied to speed up the execution of a variety of applications. There have been many approaches proposed in the field, and among them the ant colony system gets good solutions for optimization problems. In the past, the approaches for parallel runs or multiple colonies usually set the ant number in each run or each colony is the same as that in sequential ant colony optimization. In this thesis, we assume the total numbers of ants in both the sequential and the parallel processing are the same. We discuss the effects of dividing an ant colony into several groups on performance and study the migration mechanism among them. First, the sub-ant-colony scheme without migration is designed and experiments show the division of an ant colony can increase the diversity of search and thus improve the solution quality. A parallel algorithm based on the property is then proposed to speed up the execution. Next, several sub-ant-colony algorithms with different migration strategies are proposed. Especially, fixed and dynamic parameter adjustments are adopted, respectively. Experiments show that the proposed algorithms with migration can benefit from the interaction of the sub-ant-colonies.
510 1 $a A Study on the Performance of Migration in Multiple Sub-Ant Colonies $z eng
610 # 0 $a 仿生計算 $a 螞蟻族群系統 $a 子螞蟻族群 $a 遷徙 $a 主從處理
610 # 1 $a Bio-inspired Computation $a Ant Colony System $a Sub-ant-colony $a Migration $a Master-Slave Processing
681 $a 008M/0019 $b 464103 4422 $v 2007年版
700 1 $a 黃 $b 齡儀 $4 撰 $3 673374
712 0 2 $a 國立高雄大學 $b 資訊工程學系碩士班 $3 353878
801 0 $a tw $b 國立高雄大學 $c 20141021 $g CCR
856 7 # $u https://hdl.handle.net/11296/5pqvgu $2 http $z 電子資源