

 Delta Heuristic Algorithm for Boolean Optimization Problems 



 ================== File name:rn200m400t40s20c50num0
 
 The number of generated feasible points: 391
 time=271360 sec/1000

 Best point:  1111111111 1111111111 1111111111 1111111111 1111111111 
1111111111 1111111111 1111111111 1100111111 1111111111 
1111111111 1111111011 1111111111 1111111111 1111101111 
1111111111 1111111111 1111111111 1010111111 0001110011 

 With value: 21663
 Optimal :   21804 

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


 ================== File name:rn200m400t40s20c50num1
 
 The number of generated feasible points: 433
 time=279735 sec/1000

 Best point:  1111111111 1111111111 1111111111 1111111111 1011111111 
1111111111 1111111111 1111111111 1111111111 1111111111 
1111111111 1111111111 1111111111 1111111111 1111111111 
1111111111 1111111111 1111111100 0100101010 1110010011 

 With value: 23437
 Optimal :   23565 

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


 ================== File name:rn200m400t40s20c50num2
 
 The number of generated feasible points: 421
 time=310639 sec/1000

 Best point:  1111111111 1111111111 1111111111 1111111111 1111111111 
1111111111 1111111111 1111111111 1111111111 1111111111 
1111111111 1111111111 1111111111 1111111111 1111111111 
1111111111 0101111111 1011011111 0111101010 0001001111 

 With value: 23498
 Optimal :   23551 

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


 ================== File name:rn200m400t40s20c50num3
 
 The number of generated feasible points: 426
 time=283109 sec/1000

 Best point:  1111111111 1111111111 1111111111 1111111111 1111111111 
1111111111 1111111111 1111111111 1111111111 1111111111 
1111111111 1110111111 1111111111 1111111111 1110111111 
1111111111 1110111111 1101111101 0111100111 1100000111 

 With value: 23494
 Optimal :   23609 

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


 ================== File name:rn200m400t40s20c50num4
 
 The number of generated feasible points: 423
 time=290472 sec/1000

 Best point:  1111111111 1111111111 1111111111 1111111111 1111111111 
1111111111 1111111111 1111111111 1111111111 1111111111 
1111111101 1111111111 1011111111 1111111111 1011110110 
1111111111 1111101101 1111111011 1101111110 1111111011 

 With value: 23118
 Optimal :   23267 

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


 ======================= 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) = 99.49 
Worst   Quality                   = 99.35 
Best    Quality                   = 99.77 
Standard Deviation                = 0.17 

Time to find best point .... 
Average Time (sec/1000) = 124169 
Worst   Time            = 262303 
Best    Time            = 4375 
Standard Deviation      = 105871 

Best point found was feasible point/iteration number.... 
Average Feasible/Iteration    = 203 / 226 
Worst   Feasible/Iteration    = 400 / 461
Best    Feasible/Iteration    = 8 / 8
Standard Deviations           = 164 / 188 

 Total time to completion .... 
Average Time (sec/1000) = 287063 
Worst   Time            = 310639 
Best    Time            = 271360 
Standard Deviation      = 14860 

Total number of feasible points generated .... 
Average Number     = 418 
Worst   Number     = 391 
Best    Number     = 433 
Standard Deviation = 16 

First feasible point found by heuristic .... 
Average Quality (/100 of optimal) = 99.37 
Worst   Quality                   = 99.17 
Best    Quality                   = 99.64 
Standard Deviation                = 0.20 

