Algorithm of TSP based on genetic algorithm (trave
2016-08-23
5 0 0
no vote
Other
Earn points
TSP (travelling salesman problem-Traveling SalesmanProblem), is a classical NP-complete problem, namely, the worst-case time complexity as the problem grows exponentially, up to now cannot find a polynomial-time algorithm. Genetic algorithm is a kind of evolutionary algorithm, its basic principle is modeled on the biology of "natural selection, survival of the fittest" laws of evolution. Genetic algorithm approach is parameter encoded as a chromosomal problem, reuse of iteration methods of selection, crossover and mutation operation to exchange information on chromosomes in the population and eventually produce conforms to the target chromosome. Practice has proved that the genetic algorithm for solving TSP problems of combinatorial optimization problem has a better search performance.
matlab
算法
tsp
基于
遗传
问题
旅行
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment