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

Hybrid Genetic Algorithm for 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

2 Author(s)
Lai Nian ; Inst. of Inf. Eng., Xiangtan Univ., Xiangtan, China ; Zheng Jinhua

When use simple genetic algorithm for solving the traveling salesman problem, the generated optimal solution is over stochastic and does not consider the neighborhood information in whole search process. In order to reduce the randomness, the paper proposes a hybrid genetic algorithm which based on ant algorithm that making better use of the inspiration information of previous generations. In addition, it adds a local search process so that more useful information is supplied to get the optimal solution.

Published in:

Computational Intelligence and Security (CIS), 2011 Seventh International Conference on

Date of Conference:

3-4 Dec. 2011

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.