Referenced Items are not available for this document.
The traveling salesman problem (TSP) is among the most important combinatorial problems. Ant colony optimization (ACO) algorithm is a recently developed algorithm which has been successfully applied to several NP-hard problems, such as traveling salesman problem, quadratic assignment problem and job-shop problem. Association rule (AR) is the key in knowledge in data mining for finding the best data sequence. A new algorithm which integrates ACO and AR is proposed to solve TSP problems. Compare with the simulated annealing algorithm, the standard genetic algorithm and the standard ant colony algorithm, the new algorithm is better than ACO.
Published in:
Natural Computation, 2007. ICNC 2007. Third International Conference on
(Volume:3
)
Date of Conference: 24-27 Aug. 2007
- Page(s):
- 693 - 698
- Print ISBN:
- 978-0-7695-2875-5
- INSPEC Accession Number:
- 9874096
- Conference Location :
- Haikou
- Digital Object Identifier :
- 10.1109/ICNC.2007.675
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
