现代电子技术2007，Vol.30Issue(5)：117-119,3.
Using Data Mining to Find Patterns in Ant Colony Algorithm Solutions to the Travelling Salesman Problem
Using Data Mining to Find Patterns in Ant Colony Algorithm Solutions to the Travelling Salesman Problem
YAN Shiliang 1WANG Yinling1
作者信息
- 1. Engineering & Technology Center, Southwest University of Science and Technology, Mianyang, 621010, China
- 折叠
摘要
Abstract
Travelling Salesman Problem (TSP) is a classical optimization problem and it is one of a class of NP-Problem. The purposes of this work is to apply data mining methodologies to explore the patterns in data generated by an Ant Colony Algorithm (ACA) performing a searching operation and to develop a rule set searcher which approximates the ACA'S searcher. An attribute-oriented induction methodology was used to explore the relationship between an operations' sequence and its attributes and a set of rules has been developed. At the end of this paper, the experimental results have shown that the proposed approach has good performance with respect to the quality of solution and the speed of computation.关键词
data mining/Travelling salesman problem/ant colony algorithm/data management systemKey words
data mining/Travelling salesman problem/ant colony algorithm/data management system分类
信息技术与安全科学引用本文复制引用
YAN Shiliang,WANG Yinling..Using Data Mining to Find Patterns in Ant Colony Algorithm Solutions to the Travelling Salesman Problem[J].现代电子技术,2007,30(5):117-119,3.
