

 Delta Heuristic Algorithm for Boolean Optimization Problems 



 ================== File name:rn50m200t4s1c50num0
 
 The number of generated feasible points: 223
 time=42907 sec/1000

 Best point:  1111111111 0111011101 0001111011 1011001100 1010100101 

 With value: 2342
 Optimal :   2342 

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


 ================== File name:rn50m200t4s1c50num1
 
 The number of generated feasible points: 249
 time=43912 sec/1000

 Best point:  1111111101 1001101111 0110110111 0100101111 0000100101 

 With value: 2308
 Optimal :   2309 

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


 ================== File name:rn50m200t4s1c50num2
 
 The number of generated feasible points: 223
 time=47459 sec/1000

 Best point:  1101010111 1100111111 0111110100 1011111000 1011100111 

 With value: 2446
 Optimal :   2446 

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


 ================== File name:rn50m200t4s1c50num3
 
 The number of generated feasible points: 209
 time=38785 sec/1000

 Best point:  1111111111 1101111010 1001001110 1110110110 0000110001 

 With value: 2264
 Optimal :   2264 

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


 ================== File name:rn50m200t4s1c50num4
 
 The number of generated feasible points: 216
 time=40859 sec/1000

 Best point:  1101101111 0110111010 1111101000 1110011000 0110101111 

 With value: 2278
 Optimal :   2294 

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


 ================== File name:rn50m200t4s1c50num5
 
 The number of generated feasible points: 243
 time=44645 sec/1000

 Best point:  1001111111 1111110111 0001111100 1110011001 1010011001 

 With value: 2417
 Optimal :   2417 

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


 ================== File name:rn50m200t4s1c50num6
 
 The number of generated feasible points: 261
 time=41714 sec/1000

 Best point:  1111111111 0100101111 1110111101 1101110100 0001000101 

 With value: 2350
 Optimal :   2350 

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


 ================== File name:rn50m200t4s1c50num7
 
 The number of generated feasible points: 238
 time=41729 sec/1000

 Best point:  1111111101 1011011111 0110010101 1110011000 1100010111 

 With value: 2347
 Optimal :   2347 

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


 ================== File name:rn50m200t4s1c50num8
 
 The number of generated feasible points: 258
 time=41980 sec/1000

 Best point:  1110111111 1011100001 0101111100 1100101111 0111000001 

 With value: 2306
 Optimal :   2315 

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


 ================== File name:rn50m200t4s1c50num9
 
 The number of generated feasible points: 250
 time=39324 sec/1000

 Best point:  1111110011 1110101001 0111101110 0011001110 1011010101 

 With value: 2266
 Optimal :   2266 

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


 ================== File name:rn50m200t4s1c50num10
 
 The number of generated feasible points: 249
 time=43265 sec/1000

 Best point:  1011111011 1011111111 1101101011 1010010000 0101010001 

 With value: 5663
 Optimal :   5662 

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


 ================== File name:rn50m200t4s1c50num11
 
 The number of generated feasible points: 242
 time=43887 sec/1000

 Best point:  1111111011 1101101001 0011111111 1110100100 0011011001 

 With value: 5267
 Optimal :   5266 

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


 ================== File name:rn50m200t4s1c50num12
 
 The number of generated feasible points: 242
 time=45607 sec/1000

 Best point:  1111111111 1011101001 1111111100 0001010110 1000000001 

 With value: 5592
 Optimal :   5630 

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


 ================== File name:rn50m200t4s1c50num13
 
 The number of generated feasible points: 254
 time=43036 sec/1000

 Best point:  1111111110 0111011111 1001011101 1100000011 1001011001 

 With value: 4827
 Optimal :   4827 

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


 ================== File name:rn50m200t4s1c50num14
 
 The number of generated feasible points: 215
 time=38068 sec/1000

 Best point:  1111111101 1111111111 1111101101 0000100100 0000000001 

 With value: 5099
 Optimal :   5099 

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


 ================== File name:rn50m200t4s1c50num15
 
 The number of generated feasible points: 231
 time=40447 sec/1000

 Best point:  1101101111 0101101111 1111001111 0110100011 1100001001 

 With value: 5384
 Optimal :   5398 

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


 ================== File name:rn50m200t4s1c50num16
 
 The number of generated feasible points: 213
 time=42977 sec/1000

 Best point:  1101111011 1100111100 1110111111 0001101101 1000110001 

 With value: 5165
 Optimal :   5231 

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


 ================== File name:rn50m200t4s1c50num17
 
 The number of generated feasible points: 241
 time=44701 sec/1000

 Best point:  1101111111 0111000111 1110001111 1111000100 1110100101 

 With value: 5344
 Optimal :   5344 

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


 ================== File name:rn50m200t4s1c50num18
 
 The number of generated feasible points: 241
 time=43167 sec/1000

 Best point:  1111101110 1011110111 1100101010 1110101100 0100001011 

 With value: 5309
 Optimal :   5351 

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


 ================== File name:rn50m200t4s1c50num19
 
 The number of generated feasible points: 218
 time=39939 sec/1000

 Best point:  1110101111 1111111111 1111010111 0000010110 0001100001 

 With value: 5804
 Optimal :   5804 

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


 ======================= 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.80 
Worst   Quality                   = 98.74 
Best    Quality                   = 100.02 
Standard Deviation                = 0.37 

Time to find best point .... 
Average Time (sec/1000) = 15810 
Worst   Time            = 37732 
Best    Time            = 376 
Standard Deviation      = 11956 

Best point found was feasible point/iteration number.... 
Average Feasible/Iteration    = 112 / 215 
Worst   Feasible/Iteration    = 218 / 472
Best    Feasible/Iteration    = 4 / 4
Standard Deviations           = 67 / 143 

 Total time to completion .... 
Average Time (sec/1000) = 42420 
Worst   Time            = 47459 
Best    Time            = 38068 
Standard Deviation      = 2380 

Total number of feasible points generated .... 
Average Number     = 235 
Worst   Number     = 209 
Best    Number     = 261 
Standard Deviation = 16 

