Random-restart Hill Climbing Algorithm

The Random-restart Hill Climbing Algorithm is an improvement of Hill Climbling Algorithm.

When being stuck in local optima, it just simply random a new point.

Pros:

1. More efficient than Exhaustive Search, due to the avoidance of overall search.
2. The ability to jump out of local optima.

Cons:

1. If the restart point is close to the previous restart point, it may lead to the same local optimum.

One-max problem

The one-max problem is a basic problem.

Given a bit string of 0's and 1's, the aim is to find a bit string which contains the most 1's.

Usage

Open terminal

make

1. Run directly in the terminal by typing the following:

    #./main [algo] [runs] [iter] [bits] [filename]
    ./main rrhc 30 20000 100 ""
   

2. Or if you want to run multiple times, just by opening the "search.sh" and add whatever you want and run by typing

    ./search.sh
   

   in the terminal.

Customize

You can change the iteration block by modifying

    const int block=100;

in "execute.hpp".

Results