steinerbayg29.par

Java实现的遗传算法工具集：GA Playground

[Integers]
Problem Code=6
Population Size=20
Number of Genes=20
Map Order=3
Def Order=0
GA Type=1
MinMax Type=2
Crossover Type=1
Mutation Type=1
Selection Type=1
Inversion Type=1
Stagnation Limit=3
Degrade Limit=4
Survivors Percent=20
Redundancy Factor=1
Number of Variables=20
User Defined Integer=0

[Reals]
Crossover Rate=1
Mutation Rate=0.01
Inversion Rate=0.05
Shuffle Rate=0.2
Inversion Shuffle=0.5
Kick Distribution=0.2
Exit Value=7.05
Exit Tolerance=0.05
Min Value=0
Max Value=3
Step Value=0.1
Default Value=1
Kin Competition Factor=0.8
User Defined Real=0

[Strings]
Title=Steiner's Problem (Input from Bayg29 Tsp test problem)
Description=Find a point where the distances sum to all cities is minimal
Alleles Map File=TspBayg29.gmp
Alleles Def File=None
Map Delimiter=,
Input String #1=None
Input String #2=None
User Defined Expression=None
User Defined String=None

[Flags]
Status Help=True
Text Window=False
Graphic Window=True
Sound=False
Logging=False
User Defined Flag=false