

 Delta Heuristic Algorithm for Boolean Optimization Problems 



 ================== File name:rn50m200t7s2c50num0
 
 The number of generated feasible points: 332
 time=44415 sec/1000

 Best point:  0101111111 1101111111 1111111111 1111010111 0000110011 

 With value: 2945
 Optimal :   2944 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num1
 
 The number of generated feasible points: 325
 time=51681 sec/1000

 Best point:  1111110111 1111111111 1000111101 1110100111 1111010101 

 With value: 2589
 Optimal :   2607 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num2
 
 The number of generated feasible points: 393
 time=50230 sec/1000

 Best point:  1111111110 1111111111 1111111100 0110110110 0111000011 

 With value: 2698
 Optimal :   2713 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num3
 
 The number of generated feasible points: 332
 time=50407 sec/1000

 Best point:  1111111111 1111111101 0011110010 1111110100 1111110011 

 With value: 2723
 Optimal :   2740 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num4
 
 The number of generated feasible points: 337
 time=41379 sec/1000

 Best point:  1011111011 1101101011 1110011111 1111110111 1111101101 

 With value: 2763
 Optimal :   2762 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num5
 
 The number of generated feasible points: 348
 time=50190 sec/1000

 Best point:  1111110111 1011101111 1111110011 0111111111 1001100101 

 With value: 2800
 Optimal :   2800 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num6
 
 The number of generated feasible points: 333
 time=53104 sec/1000

 Best point:  1111111101 1111111001 1101111111 0111101011 1011010111 

 With value: 2913
 Optimal :   2913 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num7
 
 The number of generated feasible points: 320
 time=53181 sec/1000

 Best point:  1111111111 1011110111 1001111111 1111011011 1000011101 

 With value: 2844
 Optimal :   2843 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num8
 
 The number of generated feasible points: 336
 time=51958 sec/1000

 Best point:  1111011111 1111111010 1111111111 0100110001 1110111101 

 With value: 2866
 Optimal :   2878 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num9
 
 The number of generated feasible points: 330
 time=53122 sec/1000

 Best point:  1111111111 1111111111 1111110100 1010011101 1010101001 

 With value: 2637
 Optimal :   2638 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num10
 
 The number of generated feasible points: 336
 time=56230 sec/1000

 Best point:  1111111111 1111111110 1111111011 0011100111 1110000001 

 With value: 6262
 Optimal :   6298 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num11
 
 The number of generated feasible points: 334
 time=45345 sec/1000

 Best point:  1101111111 0111111101 1111111101 1111110001 1011001001 

 With value: 5928
 Optimal :   6034 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num12
 
 The number of generated feasible points: 345
 time=47421 sec/1000

 Best point:  1111111111 1110111111 1111111011 0100111010 0110100011 

 With value: 6643
 Optimal :   6643 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num13
 
 The number of generated feasible points: 343
 time=46333 sec/1000

 Best point:  1111111111 1101111111 1111111111 1010011000 1000100101 

 With value: 6555
 Optimal :   6590 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num14
 
 The number of generated feasible points: 337
 time=48586 sec/1000

 Best point:  1111111111 1111111111 1011111111 1110100101 0100001001 

 With value: 6513
 Optimal :   6513 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num15
 
 The number of generated feasible points: 333
 time=50075 sec/1000

 Best point:  1111111110 1111111111 1110011111 1111001000 1100101011 

 With value: 5790
 Optimal :   5837 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num16
 
 The number of generated feasible points: 353
 time=50534 sec/1000

 Best point:  1111111111 1111111111 1111011111 0010010110 0010010111 

 With value: 6087
 Optimal :   6087 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num17
 
 The number of generated feasible points: 363
 time=50075 sec/1000

 Best point:  1111111111 1111011001 0111011101 1111101011 1011110011 

 With value: 5987
 Optimal :   6127 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num18
 
 The number of generated feasible points: 302
 time=46187 sec/1000

 Best point:  1111110110 1111111101 1101101111 1111011011 0111110001 

 With value: 6039
 Optimal :   6039 

 ============================================================= 


 ================== File name:rn50m200t7s2c50num19
 
 The number of generated feasible points: 284
 time=44025 sec/1000

 Best point:  1111111111 1111101111 0111111101 1011111000 0011010111 

 With value: 5999
 Optimal :   5999 

 ============================================================= 


 ======================= Performance Statistics ====================== 

Number of variables = 50 
Number of terms     = 200 
Number of problems  = 20 

Number of iterations = 500 

Best point found by heuristic .... 
Average Quality (/100 of optimal) = 99.59 
Worst   Quality                   = 97.72 
Best    Quality                   = 100.04 
Standard Deviation                = 0.63 

Time to find best point .... 
Average Time (sec/1000) = 10539 
Worst   Time            = 41241 
Best    Time            = 202 
Standard Deviation      = 10754 

Best point found was feasible point/iteration number.... 
Average Feasible/Iteration    = 95 / 130 
Worst   Feasible/Iteration    = 323 / 432
Best    Feasible/Iteration    = 1 / 1
Standard Deviations           = 86 / 122 

 Total time to completion .... 
Average Time (sec/1000) = 49223 
Worst   Time            = 56230 
Best    Time            = 41379 
Standard Deviation      = 3720 

Total number of feasible points generated .... 
Average Number     = 335 
Worst   Number     = 284 
Best    Number     = 393 
Standard Deviation = 21 

