

 Delta Heuristic Algorithm for Boolean Optimization Problems 



 ================== File name:rn200m400t10s0c25num0
 
 The number of generated feasible points: 366
 time=176839 sec/1000

 Best point:  1111111111 1111110111 1111111111 1111111110 1111111111 
1111111111 1111111111 1111111111 1111011011 1111111111 
1110111101 1101100011 1111010111 1111111111 1110111101 
0111111100 1111111010 0111001101 0011101110 0100011111 

 With value: 22366
 Optimal :   22566 

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


 ================== File name:rn200m400t10s0c25num1
 
 The number of generated feasible points: 383
 time=178481 sec/1000

 Best point:  1111111111 1111111111 1111111011 0111111111 1111111011 
1111111111 1111111111 1111111111 0111010011 1111111111 
1111111111 1011111111 1111111101 0111111111 0110101111 
1100011111 0110001110 1001111111 1000000110 0001001011 

 With value: 20498
 Optimal :   20811 

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


 ================== File name:rn200m400t10s0c25num2
 
 The number of generated feasible points: 396
 time=176542 sec/1000

 Best point:  1111111111 1111111111 1101111111 1111111111 1111111111 
1101111111 1111011111 1001111111 1111111011 1101111111 
1101111011 1111111011 0111111110 1111011111 1010111110 
1111111001 1110011111 1001111101 0010001111 0110100101 

 With value: 21263
 Optimal :   20996 

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


 ================== File name:rn200m400t10s0c25num3
 
 The number of generated feasible points: 387
 time=167452 sec/1000

 Best point:  1111111111 1111111111 1111111111 1111111111 1111111111 
1111111110 1011111111 1111111111 1111001011 1010111111 
0111111101 1111101011 1101111111 1111100110 1111111111 
1111011011 1111100000 1101111110 1011101010 0010110001 

 With value: 21390
 Optimal :   20570 

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


 ================== File name:rn200m400t10s0c25num4
 
 The number of generated feasible points: 373
 time=179804 sec/1000

 Best point:  1111111111 1111111011 1101111111 1111111111 1111010111 
1111111111 1111111101 1111011111 1111111111 1111111111 
1011100111 1111111111 1011111110 1011111111 1101011111 
1111111011 0111100101 1001100100 1101100010 1101101101 

 With value: 21678
 Optimal :   21155 

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


 ======================= Performance Statistics ====================== 

Number of variables = 200 
Number of terms     = 400 
Number of problems  = 5 

Number of iterations = 500 

Best point found by heuristic .... 
Average Quality (/100 of optimal) = 101.07 
Worst   Quality                   = 98.50 
Best    Quality                   = 103.99 
Standard Deviation                = 2.29 

Time to find best point .... 
Average Time (sec/1000) = 125319 
Worst   Time            = 157724 
Best    Time            = 93650 
Standard Deviation      = 24291 

Best point found was feasible point/iteration number.... 
Average Feasible/Iteration    = 301 / 387 
Worst   Feasible/Iteration    = 342 / 454
Best    Feasible/Iteration    = 260 / 315
Standard Deviations           = 36 / 53 

 Total time to completion .... 
Average Time (sec/1000) = 175823 
Worst   Time            = 179804 
Best    Time            = 167452 
Standard Deviation      = 4861 

Total number of feasible points generated .... 
Average Number     = 381 
Worst   Number     = 366 
Best    Number     = 396 
Standard Deviation = 11 

First feasible point found by heuristic .... 
Average Quality (/100 of optimal) = 100.15 
Worst   Quality                   = 97.90 
Best    Quality                   = 102.28 
Standard Deviation                = 1.95 

