Cart (Loading....) | Create Account
Close category search window
 

A multiple ant colonies optimization algorithm based on immunity for solving TSP

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)
Hongquan Xue ; Sch. of Econ. & Manage., Xi''an Univ. of Technol., Xi''an, China ; Peng Zhang ; Lin Yang

The traveling salesman problem (TSP) is a wellknown NP-hard problem and extensively studied problems in combinatorial optimization. Ant colony optimization algorithm (ACOA) has been used to solve many optimization problems in various fields of engineering. In this paper, a new algorithm was presented for solving TSP using ACOA based on immunity and multiple ant colonies. The new algorithm was tested on benchmark problems from TSPLIB and the test results were presented. The experimental results show that the new algorithm effectively relieves the tensions such as the premature, the convergence and the stagnation.

Published in:

Artificial Intelligence and Education (ICAIE), 2010 International Conference on

Date of Conference:

29-30 Oct. 2010

Need Help?


IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.