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

An Adaptive Markov Chain Monte Carlo 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

3 Author(s)
Fangpeng Qiu ; Sch. of Manage., Huazhong Univ. of Sci. & Technol. ; Jinlong Zhang ; Haibo Yan

Traveling salesman problem is widely utilized as the typical issue for algorithm performance research because of its important engineering and theoretical value. An adaptive Markov Chain Monte Carlo algorithm is employed in resolving TSP for the purpose of ameliorating the temperature management problems in the original Metropolis algorithm. In order to get the balance between the runtime and route distance accuracy, the annealing parameter is no longer fixed in advance, but optimized by an adaptive sampler with simple expression and fast convergence. The simulation results shows that the adaptive algorithm has more powerful capacity of finding global solution and stability compared with those of the original Metropolis algorithm.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:1 )

Date of Conference:

12-14 Dec. 2008

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.