

 Delta Heuristic Algorithm for Boolean Optimization Problems 



 ================== File name:rn50m200t10s0c50num0
 
 The number of generated feasible points: 396
 time=55822 sec/1000

 Best point:  1111111111 1111111111 1110101111 1111110110 0101100011 

 With value: 3065
 Optimal :   3075 

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


 ================== File name:rn50m200t10s0c50num1
 
 The number of generated feasible points: 369
 time=53114 sec/1000

 Best point:  1111111111 1101111111 1110011111 1110111111 0111110001 

 With value: 3019
 Optimal :   3044 

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


 ================== File name:rn50m200t10s0c50num2
 
 The number of generated feasible points: 425
 time=59749 sec/1000

 Best point:  1111111111 1111011001 1111111011 1011111101 1011011111 

 With value: 3047
 Optimal :   3084 

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


 ================== File name:rn50m200t10s0c50num3
 
 The number of generated feasible points: 388
 time=54033 sec/1000

 Best point:  1111111110 1111011111 1111111111 0110111101 1111100011 

 With value: 2971
 Optimal :   2971 

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


 ================== File name:rn50m200t10s0c50num4
 
 The number of generated feasible points: 373
 time=53173 sec/1000

 Best point:  1111111111 1101111111 0011111011 1111011111 1000111111 

 With value: 3022
 Optimal :   3035 

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


 ================== File name:rn50m200t10s0c50num5
 
 The number of generated feasible points: 390
 time=54159 sec/1000

 Best point:  1111111111 1110101111 1111111101 1111110001 0111101111 

 With value: 3049
 Optimal :   3049 

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


 ================== File name:rn50m200t10s0c50num6
 
 The number of generated feasible points: 360
 time=52724 sec/1000

 Best point:  0111111111 1111111111 1111111111 1111100101 1100011001 

 With value: 2899
 Optimal :   2917 

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


 ================== File name:rn50m200t10s0c50num7
 
 The number of generated feasible points: 394
 time=56596 sec/1000

 Best point:  1111111111 1111111111 1101111100 1111101111 1101101001 

 With value: 3056
 Optimal :   3056 

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


 ================== File name:rn50m200t10s0c50num8
 
 The number of generated feasible points: 381
 time=58085 sec/1000

 Best point:  1111111111 1111111111 0111111111 1111100111 0100010111 

 With value: 2886
 Optimal :   2886 

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


 ================== File name:rn50m200t10s0c50num9
 
 The number of generated feasible points: 376
 time=51028 sec/1000

 Best point:  1110111111 1111111110 1111111111 1101101101 1010110111 

 With value: 3056
 Optimal :   3079 

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


 ================== File name:rn50m200t10s0c50num10
 
 The number of generated feasible points: 365
 time=57022 sec/1000

 Best point:  1111111111 1111111111 1111101110 1111011001 1001011111 

 With value: 7026
 Optimal :   7054 

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


 ================== File name:rn50m200t10s0c50num11
 
 The number of generated feasible points: 362
 time=52878 sec/1000

 Best point:  1111111111 1111111111 1111011111 1011011110 0010010011 

 With value: 6489
 Optimal :   6499 

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


 ================== File name:rn50m200t10s0c50num12
 
 The number of generated feasible points: 393
 time=56385 sec/1000

 Best point:  1111111111 1111111111 1111011011 1111101110 1011100001 

 With value: 6444
 Optimal :   6454 

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


 ================== File name:rn50m200t10s0c50num13
 
 The number of generated feasible points: 397
 time=53458 sec/1000

 Best point:  1111111111 1011111111 0111111111 1111111101 0001010011 

 With value: 6303
 Optimal :   6326 

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


 ================== File name:rn50m200t10s0c50num14
 
 The number of generated feasible points: 418
 time=57938 sec/1000

 Best point:  1111111111 1011111111 1111011110 1111100111 1110001001 

 With value: 5680
 Optimal :   5775 

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


 ================== File name:rn50m200t10s0c50num15
 
 The number of generated feasible points: 384
 time=57307 sec/1000

 Best point:  1111111111 1111110111 1111110110 1100101111 0111111101 

 With value: 6458
 Optimal :   6483 

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


 ================== File name:rn50m200t10s0c50num16
 
 The number of generated feasible points: 384
 time=55262 sec/1000

 Best point:  1111111111 1111111111 1111101110 1011110101 1111010011 

 With value: 6535
 Optimal :   6538 

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


 ================== File name:rn50m200t10s0c50num17
 
 The number of generated feasible points: 355
 time=57479 sec/1000

 Best point:  1111111111 1111111111 1111011111 1110010010 1011111011 

 With value: 6612
 Optimal :   6632 

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


 ================== File name:rn50m200t10s0c50num18
 
 The number of generated feasible points: 356
 time=55022 sec/1000

 Best point:  1111101111 1111111111 1111111111 1111111110 1000000011 

 With value: 6464
 Optimal :   6471 

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


 ================== File name:rn50m200t10s0c50num19
 
 The number of generated feasible points: 395
 time=59966 sec/1000

 Best point:  1111111111 1111111111 1111011101 1111011111 0101000011 

 With value: 6943
 Optimal :   7040 

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


 ======================= 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.55 
Worst   Quality                   = 98.35 
Best    Quality                   = 100.00 
Standard Deviation                = 0.48 

Time to find best point .... 
Average Time (sec/1000) = 25413 
Worst   Time            = 55596 
Best    Time            = 3266 
Standard Deviation      = 18071 

Best point found was feasible point/iteration number.... 
Average Feasible/Iteration    = 199 / 250 
Worst   Feasible/Iteration    = 406 / 475
Best    Feasible/Iteration    = 30 / 34
Standard Deviations           = 122 / 159 

 Total time to completion .... 
Average Time (sec/1000) = 55560 
Worst   Time            = 59966 
Best    Time            = 51028 
Standard Deviation      = 2473 

Total number of feasible points generated .... 
Average Number     = 383 
Worst   Number     = 355 
Best    Number     = 425 
Standard Deviation = 19 

