t01.out

来自「很好的一个约束遗传算法优化程序」· OUT 代码 · 共 124 行

Thu Aug 24 16:45:58 1995


Linear inequalities :
 1.00X1 - 2.00X3 <=  1.00
 1.00X1 + 1.00X4 <=  5.10


Domains :
 -1.00   <=  X1   <=    7.00 
 0.00   <=  X2   <=    4.00 
 -7.32   <=  X3   <=    1.00 
 -1.00   <=  X4   <=    1.00 


Test case number           : 1
Number of operators        : 4  4  4  4  4  4  4
Number of generations      : 500
Population size            : 70
Parameter B                : 6
Parameter Q                : 0.100000
Max/Min                    : 0
Probability of replacement : 0.150000
Initialization mode        : 1
Selection of refer. point  : 0


USING SINGLE POINT INITIAL POPULATION...


The initial point of the population is
       -0.98486304	        0.40637827	        0.24753714	       -0.82427710	
The initial point of the ref. population is
        0.50000000	        3.00000000	        0.00000000	        0.89999998	



Generation#	    Solution Value
      1 	      -11.02590752
      2 	      -17.79442787
      4 	      -19.86250687
      5 	      -23.96082687
      6 	      -24.06831741
     10 	      -24.95981789
     12 	      -26.04444313
     14 	      -26.56486702
     15 	      -28.60123825
     18 	      -28.80945396
     19 	      -30.40257645
     20 	      -30.48390007
     24 	      -30.51436615
     28 	      -31.30309296
     32 	      -31.71919823
     39 	      -31.73423958
     40 	      -31.74542046
     43 	      -31.74577141
     46 	      -31.76305199
     50 	      -31.76833916
     51 	      -31.78640175
     53 	      -31.78684425
     54 	      -31.79408646
     55 	      -31.87288475
     57 	      -31.87831497
     58 	      -31.90776062
     60 	      -31.92994118
     64 	      -31.96310425
     67 	      -31.98868942
     69 	      -31.98948288
     70 	      -31.99987984
     73 	      -32.01699448
     77 	      -32.02027130
     81 	      -32.02277374
     84 	      -32.02421188
     88 	      -32.03133011
     89 	      -32.05244446
    102 	      -32.06120300
    107 	      -32.06225967
    115 	      -32.06365967
    125 	      -32.06367874
    127 	      -32.06386566
    151 	      -32.06457520
    164 	      -32.06458282
    200 	      -32.06465912
    202 	      -32.06466293
    212 	      -32.06526947
    213 	      -32.06544113
    216 	      -32.06546402
    218 	      -32.06567001
    221 	      -32.06669235
    223 	      -32.06670761
    236 	      -32.06698227
    237 	      -32.06710434
    238 	      -32.06715012
    239 	      -32.06717682
    242 	      -32.06721497
    243 	      -32.06724548
    247 	      -32.06730652
    269 	      -32.06736755
    276 	      -32.06745911
    277 	      -32.06752396
    279 	      -32.06755066
    283 	      -32.06756973
    296 	      -32.06761551
    297 	      -32.06764603
    321 	      -32.06768036
    330 	      -32.06768417
    360 	      -32.06768799
    416 	      -32.06769180
    426 	      -32.06769562
    492 	      -32.06769943

Best solution was found at generation 500 (solution value = -32.06769943)


Best solution found:

 X[ 1] :	        2.49917865
 X[ 2] :	        2.38553596
 X[ 3] :	        1.00000000
 X[ 4] :	       -0.08397896


Total run time : 132 seconds