By Topic

Ant Colony Optimization Algorithms for the Traveling Salesman Problem

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
$15 $15
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)

This chapter contains sections titled: The Traveling Salesman Problem, ACO Algorithms for the TSP, Ant System and Its Direct Successors, Extensions of Ant System, Parallel Implementations, Experimental Evaluation, ACO plus Local Search, Implementing ACO Algorithms, Bibliographical Remarks, Things to Remember, Computer Exercises