- Category:
- Other Books
- Tags:
-
[PDF]
- File Size:
- 5.01mb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
- wong
Description: The traveling salesman problem is a typical NP problem.This paper
implements a program to resolve the TSP problem according to the improved
Genetic Algorithm,and calculate a TSP problem of 48 cites.Comparing the
calculation result of GA program and Simulated Annealing Algorithm.This
paper describes the parameters selection and the coding method,fitness
function design,population’s initialization and genetic operators’design in
the program of resolving the TSP using the improved genetic algorithm.
The result proves that the improved GA program excels the SA program.
The improved GA program can get the satisfied result in a short time.
To Search:
File list (Check if you may need any files):
一種改進的遺傳算法在TSP問題中的應用研究.pdf
Download