

 Delta Heuristic Algorithm for Boolean Optimization Problems 



 ================== File name:rn50m200t7s0c50num0
 
 The number of generated feasible points: 357
 time=49707 sec/1000

 Best point:  0111111111 1011111111 0111111111 1110010101 1011100101 

 With value: 2821
 Optimal :   2842 

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


 ================== File name:rn50m200t7s0c50num1
 
 The number of generated feasible points: 373
 time=47227 sec/1000

 Best point:  1111111111 1101111011 1111111100 0011111011 0011010111 

 With value: 2867
 Optimal :   2902 

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


 ================== File name:rn50m200t7s0c50num2
 
 The number of generated feasible points: 363
 time=45862 sec/1000

 Best point:  1011011110 1111101101 0011111111 1011111111 1011011111 

 With value: 2807
 Optimal :   2807 

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


 ================== File name:rn50m200t7s0c50num3
 
 The number of generated feasible points: 374
 time=50741 sec/1000

 Best point:  1111111111 1110111101 1110001111 0111011111 1001111011 

 With value: 2927
 Optimal :   2927 

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


 ================== File name:rn50m200t7s0c50num4
 
 The number of generated feasible points: 350
 time=46432 sec/1000

 Best point:  1111101111 1101111010 1111110111 1011111111 1010010111 

 With value: 2786
 Optimal :   2787 

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


 ================== File name:rn50m200t7s0c50num5
 
 The number of generated feasible points: 333
 time=47820 sec/1000

 Best point:  1111111111 0111101111 0111111011 1101011111 1000010111 

 With value: 2825
 Optimal :   2828 

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


 ================== File name:rn50m200t7s0c50num6
 
 The number of generated feasible points: 366
 time=49485 sec/1000

 Best point:  1111111101 1111111111 1011111001 1111011101 0100110011 

 With value: 2947
 Optimal :   2969 

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


 ================== File name:rn50m200t7s0c50num7
 
 The number of generated feasible points: 366
 time=54905 sec/1000

 Best point:  1111111111 1111011111 1110101110 1100111011 0111101001 

 With value: 2840
 Optimal :   2839 

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


 ================== File name:rn50m200t7s0c50num8
 
 The number of generated feasible points: 347
 time=46311 sec/1000

 Best point:  1111111111 1111111111 0111001001 1001100111 1110111001 

 With value: 2820
 Optimal :   2836 

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


 ================== File name:rn50m200t7s0c50num9
 
 The number of generated feasible points: 378
 time=45959 sec/1000

 Best point:  0111111111 1111111111 0111111101 1011100100 0011110111 

 With value: 2785
 Optimal :   2813 

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


 ================== File name:rn50m200t7s0c50num10
 
 The number of generated feasible points: 358
 time=49165 sec/1000

 Best point:  1111101111 1111110111 1111011011 1111011101 1000110001 

 With value: 6433
 Optimal :   6455 

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


 ================== File name:rn50m200t7s0c50num11
 
 The number of generated feasible points: 310
 time=48937 sec/1000

 Best point:  1111111111 1111101111 1011111111 1110011101 1010000011 

 With value: 5941
 Optimal :   5941 

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


 ================== File name:rn50m200t7s0c50num12
 
 The number of generated feasible points: 347
 time=49251 sec/1000

 Best point:  1111111111 1111111111 0111111101 1001101101 1001100001 

 With value: 6325
 Optimal :   6333 

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


 ================== File name:rn50m200t7s0c50num13
 
 The number of generated feasible points: 316
 time=46576 sec/1000

 Best point:  1111111111 1111111011 1110011011 1110111100 1110100001 

 With value: 6113
 Optimal :   6113 

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


 ================== File name:rn50m200t7s0c50num14
 
 The number of generated feasible points: 346
 time=47826 sec/1000

 Best point:  1111111110 1110111111 1011111101 1111100110 1111100001 

 With value: 5692
 Optimal :   5759 

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


 ================== File name:rn50m200t7s0c50num15
 
 The number of generated feasible points: 348
 time=51615 sec/1000

 Best point:  1111111111 1111011111 1111110111 0101111000 1010011011 

 With value: 6124
 Optimal :   6124 

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


 ================== File name:rn50m200t7s0c50num16
 
 The number of generated feasible points: 346
 time=41923 sec/1000

 Best point:  1111101111 1111111111 1001111011 1010111101 0010001011 

 With value: 6536
 Optimal :   6725 

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


 ================== File name:rn50m200t7s0c50num17
 
 The number of generated feasible points: 298
 time=46941 sec/1000

 Best point:  1111111111 1111011111 0111111111 0111111101 0010001001 

 With value: 6108
 Optimal :   6108 

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


 ================== File name:rn50m200t7s0c50num18
 
 The number of generated feasible points: 317
 time=47487 sec/1000

 Best point:  1111111111 0111111111 1111111110 1101010111 0101001001 

 With value: 6779
 Optimal :   6805 

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


 ================== File name:rn50m200t7s0c50num19
 
 The number of generated feasible points: 317
 time=44870 sec/1000

 Best point:  1111011111 1110111101 1111111111 1100111101 1100000111 

 With value: 6299
 Optimal :   6346 

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


 ======================= 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.50 
Worst   Quality                   = 97.19 
Best    Quality                   = 100.04 
Standard Deviation                = 0.69 

Time to find best point .... 
Average Time (sec/1000) = 15538 
Worst   Time            = 47070 
Best    Time            = 200 
Standard Deviation      = 13149 

Best point found was feasible point/iteration number.... 
Average Feasible/Iteration    = 135 / 186 
Worst   Feasible/Iteration    = 329 / 496
Best    Feasible/Iteration    = 1 / 1
Standard Deviations           = 102 / 146 

 Total time to completion .... 
Average Time (sec/1000) = 47952 
Worst   Time            = 54905 
Best    Time            = 41923 
Standard Deviation      = 2733 

Total number of feasible points generated .... 
Average Number     = 345 
Worst   Number     = 298 
Best    Number     = 378 
Standard Deviation = 23 

