Implementation of the Annealing search algorithm

[cmoins]

I createad a new class named AnnealingSearch that implements the annealing search algorithm. This class has the three usual type parameters A,S, N but not type parameter for the cost that is a Double.
Users can tune the following parameters to adapt the algorithm to their environment:

• alpha and tmin: parameters of the cooling schedule
• acceptance probability function: function to compute the probability that a node with a higher cost becomes nevertheless the new global optimum
• successor finder: function to find the next possible successor of the current global optimum. Simple random selection by default, new implementations my want to take into account the cost of successors.

[codecov-io]

Current coverage is 52.11%

Merging #168 into 1.0.X will decrease coverage by -1.79% as of 68bd976

@@            1.0.X    #168   diff @@
=====================================
  Files          58      59     +1
  Stmts        1714    1773    +59
  Branches      274     289    +15
  Methods                         
=====================================
  Hit           924     924       
  Partial        67      67       
- Missed        723     782    +59

Review entire Coverage Diff as of 68bd976

Powered by Codecov. Updated on successful CI builds.

[pablormier]

Awesome contrib!! code looks nice and its perfectly integrated with the rest of the components, great!. Thank you so much

[cmoins]

@pablormier I forgot to add the required keywords so that issue 158 is closed automatically on commit. I guess that in this case it is up to the owner of the project to close the issue ?

[pablormier]

@cmoins yes, no worries. Thanks!