Research of using genetic algorithm of improvement to compute the most short path

  • Authors:

  • Gaoqi Wei;Xiaoyao Xie

  • Affiliations:

  • The Key Laboratory of Information and Computing Science of Guizhou Province, Guizhou Normal University, Guiyang, China and School of Mathematics & Computer Science of Guizhou Normal University, Gu ...;The Key Laboratory of Information and Computing Science of Guizhou Province, Guizhou Normal University, Guiyang, China and School of Mathematics & Computer Science of Guizhou Normal University, Gu ...

  • Venue:
  • ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The genetic algorithm is a computation model that simulats Darwin's genetic selection and the natural selection organic evolution process. Its thought stems from the biological genetics and the survival of the fittest natural law, and has "the survival + examination" iterative process searching algorithm. As one kind of new global optimization searching algorithm, the genetic algorithm by its simple general, robustness strong, is suitable for the parallel processing as well as highly effective, practical and so on outstanding feature, it obtained the widespread application in each domain, has obtained the good results, and becomes one of gradually important intelligent algorithms. This article makes the improvement to the original genetic algorithm, and uses the C++ language to realize, through to the TSP question's test experiment, after obtaining the improvement the result, the effect is very good.