现代电子技术
現代電子技術
현대전자기술
MODERN ELECTRONICS TECHNIQUE
2007年
5期
117-119
,共3页
data mining%Travelling salesman problem%ant colony algorithm%data management system
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.