Description: This paper the problem using genetic algorithm for the shortest path, the problem can be described as: a university campus in a number of places, the places related to the distance between a cij, goal is to find a starting point s to the designated t the end of a specified path, bringing the total minimum distance.
To Search:
File list (Check if you may need any files):
程序\Debug\sga.exe
....\.....\sga.ilk
....\.....\sga.obj
....\.....\sga.pdb
....\.....\test1.txt
....\.....\vc60.idb
....\.....\vc60.pdb
....\Release\sga.exe
....\.......\sga.obj
....\.......\test1.txt
....\.......\vc60.idb
....\sga.cpp
....\sga.dsp
....\sga.dsw
....\sga.ncb
....\sga.opt
....\sga.plg
....\test1.txt
....\Debug
....\Release
程序
Download