A Novel algorithm of Genetic.pdfVIP

康寧學報 6：1－15 （2004） 1 A Novel algorithm of Genetic Ant Colony Optimization (GACO) for Traveling Salesman Problem Zne-Jung Lee* Abstract In this paper, a novel algorithm of genetic ant colony optimization (GACO) is proposed for traveling salesman problem (TSP). TSP is to minimize the cost of travel of a salesman in visiting all the cities in a given set, and return to the starting city. Basically, the proposed algorithm combines ant colony optimization (ACO) with genetic algorithm (GA) and can explore and exploit search spaces. It has both the advantage of ACO, the ability to find feasible solutions and to avoid premature convergence, and that of GA, the ability to avoid being trapped in local optima. In this paper, variant test problems are drawn from randomly generated data and the most well known TSP problems chosen from TSPLIB. Simulation results are reported, and the proposed algorithm seems to have admirable performance. Keywords：Genetic Algorithm, Ant colony optimization, Traveling Salesman Problem. * Assistant professor, Director of Department of Information Management, Kang-Ning Junior College of Medical Care and Management ◆康寧學報 第六期◆民國九十三年六月 2 應用基因蟻群最佳化方法解旅行者售貨員問題 李 仁 鐘* 摘 要 本文提出應用基因蟻群最佳化方法解旅行者售貨員問題。基本上旅行者售 貨員問題乃是給定一個有 N個城市的集合，一個售貨員想要確實地拜訪每一 個城市然後再回到開始的城市，以求得最短的距離。本文中提出以結合基因演 算法及蟻群最佳化方法來解旅行者售貨員問題，此演算法兼具基因演算法及蟻 群最佳化方法優點，其搜尋時兼具廣域及區域搜尋優點，可找到可行解、避免 提早收斂、落入區域最佳解中而無法找到廣域最佳解。本文中所測試的旅行者 售貨員問題包含經由亂數產生的資料及由TSPLIB中所提供的測試題型。經由 模擬結果顯示，本文所提出的方法優於其他演算法則。 關鍵詞：基因演算法、蟻群最佳化演算法、旅行者售貨員問題 *康寧醫護暨管理專科學校 助理教授兼資訊管理科主任 A Novel algorithm of Genetic Ant Colony Optimization (GACO) for Traveling Salesman Problem 3 I、Introduction Traveling salesman problem (TSP) is the optimization problem of finding a shortest closed tour that visits all the given cities. It is known as a classical NP-complete problem, which has extremely large search spaces and is very