The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSAT problems

Heuristic algorithms, especially hill‐climbing algorithms, are prone to being trapped by local optimization. Many researchers have focused on analyzing convergence and runtime of some heuristic algorithms on SAT‐solving problems. However, there is rare work on analyzing success ratio (the ratio of the number of runs that find the global maxima of optimization versus the total runs) and expected fitness at each generation. Expected fitness at each generation could lead us to better understand the expected fitness of a heuristic algorithm could find on the problem to be solve at a certain generation. Success ratio help us understand with what a probability a heuristic algorithm could find the global optimization of the problem to be solved. So, this paper analyzed expected fitness and success ratio of two hill‐climbing algorithms on two bimodal MaxSAT problems by using Markov chain. The theoretical and experimental results showed that though hill‐climbing algorithms (both hill‐climbing RandomWalk and Local (1+1)EA) converged faster, they could not always find global maxima of bimodal SAT‐solving problems. The success ratios of hill‐climbing algorithms usually have their own limits. The limit of success ratio is dependent on the SAT‐solving problem itself and the expected distribution of initial bit string, and independent on whether hill‐climbing RandomWalk or Local (1+1)EA is used.