巡回セールスマンを遺伝的アルゴリズムでなアレ
目下選抜は上位n個体なのですぐ局所解に堕ちます
c=50-100, n=200, m=250, p=0.03 あたりがおすすめ
ref.
http://www.sist.ac.jp/~suganuma/kougi/other_lecture/SE/opt/GA/GA.htm
c (Cities)
:
n (population size)
:
m (# of pairs to gain children)
:
p (mutation rate) [0-1]
:
g (# of generations)
:
Submit
Gen
Best
Worst
Median