By Topic

Architecture for high-speed Ant Colony Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Masaya Yoshikawa ; Meijo University. ; Hidekazu Terai

The traveling salesman problem (TSP) is one of the most important problems in combinational optimization. Many works have done for this problem using ant colony optimization (ACO). The ACO is one of the most powerful optimization methods that combines distributed computation, auto-catalysis (positive feedback) and constructive greedy heuristic in finding optimal solutions for combinational optimization problems. Most of these previous works deal with software processing. However, ACO has the inherent problem of requiring substantial processing time. Therefore, the dedicated ACO hardware becomes important when applying ACO to combinational problems. In this paper, we propose a new hardware architecture for ACO. No previous studies have, to our knowledge, applied ACO hardware to TSP, as this study does using the proposed architecture. Experimental results to evaluate the proposed algorithm show improvement comparison with software processing.

Published in:

2007 IEEE International Conference on Information Reuse and Integration

Date of Conference:

13-15 Aug. 2007