Abstract
This paper introduces a proactive version of Hill Climbing (or Local Search). It is based on the identification of the best neighborhood through the repeated application of mutations and the evaluation of theses neighborhood by using FDC (Fitness Distance Correlation). The best neighborhood is used during a time window, and then the analysis is repeated. An experimental study was conducted in 28 functions on binary strings. The proposed algorithm achieves good performance compared to other metaheuristics (Evolutionary Algorithms, Great Deluge Algorithm, Threshold Accepting, and RRT).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
