By Topic

Implementation of Ant Colony Algorithm Based on GPU

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
$31 $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

3 Author(s)
Wang Jiening ; Air Traffic Manage. Res. Base, Civil Aviation Univ. of China, Tianjin, China ; Dong Jiankang ; Zhang Chunfeng

Ant colony algorithm is an efficient intelligent algorithm to solve NP hard problem. This paper presents a parallel computing solution based on General Purpose GPU (GPGPU) to solve traveling salesman problem (TSP) with max-min ant system (MMAS). The experimental result shows it is more efficient than pure CPU computing.

Published in:

Computer Graphics, Imaging and Visualization, 2009. CGIV '09. Sixth International Conference on

Date of Conference:

11-14 Aug. 2009