Research on improved convergence co-evolution genetic algorithm for TSPs
by Ming Shao
International Journal of Convergence Computing (IJCONVC), Vol. 1, No. 2, 2014

Abstract: When the genetic algorithms are applied to solve travelling salesman problems, they are often faced with the problems of early convergence and being trapped in a local optimum. On the basis of co-evolution strategy, this paper proposes an improved genetic algorithm, which dynamically adjusts its fitness function and the probabilities of evolution operator in order to reduce the possible individual inbreeding degradation, and then effectively controls the evolutionary process. Compared with typical genetic algorithms, this improved algorithm can improve the speed of convergence and obtains better performance. Finally, this algorithm is verified on the TSP problem in 144 cities in China. The simulation results show that the improved genetic algorithm has better global searching performance and uses less convergence time.

Online publication date: Sat, 30-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Convergence Computing (IJCONVC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com