I am interested in Optimazation Problem, Especially Shortest Path Problem.
So, I tried to find shortest paths by Genetic Algorithm (GA).(ja:遺伝的アルゴリズム)
GA is sometimes used as the method to solve Traveling Salesman Problem (ja: 巡回セールスマン問題).
I coded this program for the class in NITK. You can read the report I submited .(out/GAapp.pdf)
I've not still coded for public version whoever can run. I'll try soon!
These are the intial generaion of a path route, around Hitoyoshi city, Kumamoto pref.
There are various pattern of path route to destination from source.
- source : lower left
- destination : upper right
Finally, we can get it might be shotest path, but this isn't best though.
This is might be good solution. This path is created by other initial generation. Actually, this path isn't best path, but it was extremely shorter than first generarion.
