# Problem number 1
nsource 8
ndest   6
sources
12   7   6   11   10   4   4   3 
dests
13  11   9    7    3  14
costs
  1   3   8  11   4   4
  4   0  12   1   1   1
  3   3   1   5   7   9
  9   4   1   0   0   5
  8   9  14  11  11  10
 19  12  40   1  39  11
 18   2   5   7   9   9
  4   6   9   1   0   9
optimum 0
pop    40
cross   2
inver   0
mutat   8
sprob   0.9
it      200
run 250
seed    1

run 251
seed 9999

run 252
seed 1313

run 253
seed 13333

run 254
seed 33333

end
