Description: Traveling Salesman Problem Based on Genetic Algorithm for Traveling Salesman Problem: Suppose a salesman, to sell goods to the n cities, he has to find a city that contains all n-loop with minimum overhead
To Search:
File list (Check if you may need any files):
程序\Debug\GA.obj
....\.....\main.ilk
....\.....\main.obj
....\.....\main.pch
....\.....\main.pdb
....\.....\vc60.idb
....\.....\vc60.pdb
....\GA.cpp
....\GA.h
....\main.cpp
....\main.dsp
....\main.dsw
....\main.exe.exe
....\main.ncb
....\main.opt
....\main.plg
....\o_time.h
....\Debug
程序
Download