

 Delta Heuristic Algorithm for Boolean Optimization Problems 



 ================== File name:rn50m200t4s2c50num0
 
 The number of generated feasible points: 205
 time=39841 sec/1000

 Best point:  1101111111 1111010101 1110101010 0110010101 0010100001 

 With value: 2151
 Optimal :   2201 

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


 ================== File name:rn50m200t4s2c50num1
 
 The number of generated feasible points: 178
 time=36868 sec/1000

 Best point:  1111011111 1011110011 0011111011 0011001011 0010100101 

 With value: 2297
 Optimal :   2297 

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


 ================== File name:rn50m200t4s2c50num2
 
 The number of generated feasible points: 247
 time=40759 sec/1000

 Best point:  1111111111 0111011111 1100000011 0110011011 0001001001 

 With value: 2202
 Optimal :   2256 

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


 ================== File name:rn50m200t4s2c50num3
 
 The number of generated feasible points: 146
 time=36203 sec/1000

 Best point:  1110111111 0010111011 0100011100 1110110010 1011110001 

 With value: 2188
 Optimal :   2187 

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


 ================== File name:rn50m200t4s2c50num4
 
 The number of generated feasible points: 166
 time=36843 sec/1000

 Best point:  1111101011 0111111101 1101101101 1011001010 0110000011 

 With value: 2346
 Optimal :   2346 

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


 ================== File name:rn50m200t4s2c50num5
 
 The number of generated feasible points: 154
 time=44507 sec/1000

 Best point:  1111110111 0011110101 0111111110 1000101001 1001000001 

 With value: 2197
 Optimal :   2197 

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


 ================== File name:rn50m200t4s2c50num6
 
 The number of generated feasible points: 152
 time=34200 sec/1000

 Best point:  1110111011 1100110111 1111110110 1101010100 0000110001 

 With value: 2342
 Optimal :   2342 

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


 ================== File name:rn50m200t4s2c50num7
 
 The number of generated feasible points: 179
 time=39027 sec/1000

 Best point:  1111101111 0101111010 1110011010 1010110011 1100000011 

 With value: 2188
 Optimal :   2198 

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


 ================== File name:rn50m200t4s2c50num8
 
 The number of generated feasible points: 188
 time=39758 sec/1000

 Best point:  1101101111 0010011110 1111110111 1010110010 0101111101 

 With value: 2397
 Optimal :   2397 

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


 ================== File name:rn50m200t4s2c50num9
 
 The number of generated feasible points: 175
 time=44189 sec/1000

 Best point:  1111110010 0011011000 1110111110 1111001000 1001010011 

 With value: 2074
 Optimal :   2074 

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


 ================== File name:rn50m200t4s2c50num10
 
 The number of generated feasible points: 172
 time=41597 sec/1000

 Best point:  0011111111 0111111101 0011100111 1000011010 0010011111 

 With value: 4674
 Optimal :   4674 

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


 ================== File name:rn50m200t4s2c50num11
 
 The number of generated feasible points: 164
 time=38051 sec/1000

 Best point:  1011110111 1110101101 1100111101 0101101100 0011000011 

 With value: 4961
 Optimal :   4970 

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


 ================== File name:rn50m200t4s2c50num12
 
 The number of generated feasible points: 176
 time=36273 sec/1000

 Best point:  1100011111 1011011111 1110010101 1110100000 0110000111 

 With value: 4869
 Optimal :   4875 

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


 ================== File name:rn50m200t4s2c50num13
 
 The number of generated feasible points: 205
 time=41116 sec/1000

 Best point:  1111110010 0111101011 1110101100 1101100111 0100000001 

 With value: 4503
 Optimal :   4580 

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


 ================== File name:rn50m200t4s2c50num14
 
 The number of generated feasible points: 170
 time=42999 sec/1000

 Best point:  0111100111 1011011110 1010011101 1110001001 1001100001 

 With value: 4450
 Optimal :   4450 

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


 ================== File name:rn50m200t4s2c50num15
 
 The number of generated feasible points: 149
 time=42335 sec/1000

 Best point:  1111111111 1100111000 1111011111 0100000000 0000000001 

 With value: 4636
 Optimal :   4705 

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


 ================== File name:rn50m200t4s2c50num16
 
 The number of generated feasible points: 180
 time=40027 sec/1000

 Best point:  1111111110 0001111101 0111101010 1011100100 1000000101 

 With value: 4910
 Optimal :   4911 

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


 ================== File name:rn50m200t4s2c50num17
 
 The number of generated feasible points: 160
 time=37614 sec/1000

 Best point:  1001111101 1101111111 1111111000 0011110010 0100000001 

 With value: 5044
 Optimal :   5044 

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


 ================== File name:rn50m200t4s2c50num18
 
 The number of generated feasible points: 230
 time=44063 sec/1000

 Best point:  1111110111 1011101111 1111101101 1001100000 0100100001 

 With value: 5724
 Optimal :   5724 

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


 ================== File name:rn50m200t4s2c50num19
 
 The number of generated feasible points: 185
 time=41802 sec/1000

 Best point:  1110101111 1111110011 1010100110 0101001101 0000011001 

 With value: 4957
 Optimal :   4957 

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


 ======================= 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.57 
Worst   Quality                   = 97.61 
Best    Quality                   = 100.05 
Standard Deviation                = 0.81 

Time to find best point .... 
Average Time (sec/1000) = 9853 
Worst   Time            = 33351 
Best    Time            = 243 
Standard Deviation      = 10091 

Best point found was feasible point/iteration number.... 
Average Feasible/Iteration    = 60 / 144 
Worst   Feasible/Iteration    = 170 / 473
Best    Feasible/Iteration    = 1 / 1
Standard Deviations           = 49 / 142 

 Total time to completion .... 
Average Time (sec/1000) = 39903 
Worst   Time            = 44507 
Best    Time            = 34200 
Standard Deviation      = 2977 

Total number of feasible points generated .... 
Average Number     = 179 
Worst   Number     = 146 
Best    Number     = 247 
Standard Deviation = 26 

