

 Delta Heuristic Algorithm for Boolean Optimization Problems 



 ================== File name:rn50m200t4s0c50num0
 
 The number of generated feasible points: 251
 time=39784 sec/1000

 Best point:  0011111111 1101111101 0111101111 0101101010 0110100101 

 With value: 2382
 Optimal :   2385 

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


 ================== File name:rn50m200t4s0c50num1
 
 The number of generated feasible points: 277
 time=58957 sec/1000

 Best point:  1101111111 0111101111 1110111110 1110101010 0000000101 

 With value: 2406
 Optimal :   2406 

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


 ================== File name:rn50m200t4s0c50num2
 
 The number of generated feasible points: 263
 time=49594 sec/1000

 Best point:  1111111111 0111111101 1101100110 1110010001 0101000101 

 With value: 2331
 Optimal :   2331 

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


 ================== File name:rn50m200t4s0c50num3
 
 The number of generated feasible points: 278
 time=42730 sec/1000

 Best point:  1111101101 1100110101 0100011110 1100111111 1011001111 

 With value: 2337
 Optimal :   2337 

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


 ================== File name:rn50m200t4s0c50num4
 
 The number of generated feasible points: 251
 time=39564 sec/1000

 Best point:  1101110110 1111010110 1111011101 1011011011 0101000101 

 With value: 2329
 Optimal :   2329 

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


 ================== File name:rn50m200t4s0c50num5
 
 The number of generated feasible points: 259
 time=39900 sec/1000

 Best point:  0111010101 0110111111 0101111011 1111101001 1101100101 

 With value: 2386
 Optimal :   2386 

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


 ================== File name:rn50m200t4s0c50num6
 
 The number of generated feasible points: 226
 time=37357 sec/1000

 Best point:  1110111111 1111111111 1111010010 0110100101 1000000001 

 With value: 2437
 Optimal :   2437 

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


 ================== File name:rn50m200t4s0c50num7
 
 The number of generated feasible points: 259
 time=41262 sec/1000

 Best point:  1111111110 1111111001 0101011100 1111111011 0001000001 

 With value: 2427
 Optimal :   2426 

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


 ================== File name:rn50m200t4s0c50num8
 
 The number of generated feasible points: 252
 time=38762 sec/1000

 Best point:  1111101110 1110101011 0011111111 1100101101 0001001001 

 With value: 2320
 Optimal :   2333 

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


 ================== File name:rn50m200t4s0c50num9
 
 The number of generated feasible points: 275
 time=44963 sec/1000

 Best point:  1111110111 1111011101 0110001000 0111111100 1100010011 

 With value: 2359
 Optimal :   2359 

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


 ================== File name:rn50m200t4s0c50num10
 
 The number of generated feasible points: 225
 time=40326 sec/1000

 Best point:  1010110111 1111111101 1110111010 0110001111 0011110001 

 With value: 5896
 Optimal :   5896 

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


 ================== File name:rn50m200t4s0c50num11
 
 The number of generated feasible points: 243
 time=45315 sec/1000

 Best point:  1111111101 0111111101 1110101010 0111001000 1001101001 

 With value: 5415
 Optimal :   5457 

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


 ================== File name:rn50m200t4s0c50num12
 
 The number of generated feasible points: 247
 time=41643 sec/1000

 Best point:  1111111111 1001111111 1110001011 1110101100 1000000001 

 With value: 5517
 Optimal :   5516 

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


 ================== File name:rn50m200t4s0c50num13
 
 The number of generated feasible points: 267
 time=47908 sec/1000

 Best point:  1111111111 1100111111 1011001000 1100110111 1100000001 

 With value: 5106
 Optimal :   5106 

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


 ================== File name:rn50m200t4s0c50num14
 
 The number of generated feasible points: 239
 time=39620 sec/1000

 Best point:  1111101100 1111111111 1010011111 1100100100 1100010001 

 With value: 5138
 Optimal :   5233 

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


 ================== File name:rn50m200t4s0c50num15
 
 The number of generated feasible points: 238
 time=43293 sec/1000

 Best point:  1111110111 1111010110 1111100011 0110111110 1000110001 

 With value: 5891
 Optimal :   5891 

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


 ================== File name:rn50m200t4s0c50num16
 
 The number of generated feasible points: 248
 time=40653 sec/1000

 Best point:  1111111111 1111111111 1111000000 1100000110 0000000001 

 With value: 5172
 Optimal :   5171 

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


 ================== File name:rn50m200t4s0c50num17
 
 The number of generated feasible points: 248
 time=43358 sec/1000

 Best point:  1001111111 1110111110 1011101111 1100111100 0001001001 

 With value: 5832
 Optimal :   5832 

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


 ================== File name:rn50m200t4s0c50num18
 
 The number of generated feasible points: 242
 time=36798 sec/1000

 Best point:  1111011111 1111001111 1011111111 0010100110 0010100001 

 With value: 5878
 Optimal :   5878 

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


 ================== File name:rn50m200t4s0c50num19
 
 The number of generated feasible points: 250
 time=40133 sec/1000

 Best point:  1110111111 1111110010 1011111111 1100011001 0110000001 

 With value: 5966
 Optimal :   5965 

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


 ======================= 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.84 
Worst   Quality                   = 98.18 
Best    Quality                   = 100.04 
Standard Deviation                = 0.44 

Time to find best point .... 
Average Time (sec/1000) = 9697 
Worst   Time            = 38760 
Best    Time            = 221 
Standard Deviation      = 9654 

Best point found was feasible point/iteration number.... 
Average Feasible/Iteration    = 81 / 140 
Worst   Feasible/Iteration    = 255 / 494
Best    Feasible/Iteration    = 1 / 1
Standard Deviations           = 65 / 126 

 Total time to completion .... 
Average Time (sec/1000) = 42596 
Worst   Time            = 58957 
Best    Time            = 36798 
Standard Deviation      = 5055 

Total number of feasible points generated .... 
Average Number     = 251 
Worst   Number     = 225 
Best    Number     = 278 
Standard Deviation = 15 

