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 intial generaion, around Hitoyoshi city, Kumamoto pref.
![init-0(0 061068121083690155)](https://user-images.githubusercontent.com/72023343/153434609-b876194e-ff4a-4bed-877e-b261b6bb7635.png| width=100px)