調適型螞蟻演算法應用於旅行推銷員問題之研究

CHUR > College of Management > Department of Transportation Technology and Logistice Management > Journal Articles > Item 987654321/35772

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/35772

Title:	調適型螞蟻演算法應用於旅行推銷員問題之研究
Authors:	張靖 Chang, Ching
Contributors:	運輸科技與物流管理學系 Transportation Technology and Logistics Management
Keywords:	螞蟻演算法;旅行推銷員問題;螞蟻演算法參數控制 Ant Colony optimization;Traveling salesman problem;ACO parameters control
Date:	2007
Issue Date:	2014-06-27 10:49:14 (UTC+8)
Abstract:	螞蟻演算法為近年來廣被探討的一種巨集啟發式方法，也被統稱為螞蟻群落最佳化 (ACO) 方法。ACO已被成功應用於求解許多複雜的組合最佳化問題上，並衍生出多種不同的執行機制，例如：AS、ACS、Ant-Q、Max-Min AS與ASrank，這些執行機制的主要差異在於路徑搜尋機制與費洛蒙更新機制兩個部分。本研究之目的即針對ACO的路徑搜尋機制及其控制參數設定進行深入研究，提出一個調適型螞蟻演算法 (AACS)的執行機制，並提出兩種改良式的費洛蒙更新機制，然後選擇24個旅行推銷員問題的國際標竿例題 (題目規模 The Ant Algorithm, also named as Ant Colony Optimization (ACO), is recently a famous meta-heuristic approach that has been successfully applied to solve many complicated Combinatorial Optimization Problems. Furthermore, several variants of the Ant Algorit
Appears in Collections:	[Department of Transportation Technology and Logistice Management] Journal Articles

Files in This Item:

File	Description	Size	Format
p_m620_0015.pdf		37Kb	Adobe PDF	109	View/Open