Effect of Local Search on Edge Histogram Based Sampling Algorithms for Permutation Problems
Shigeyoshi Tsutsui, Martin Pelikán, Ashish Kumar Ghosh · 2005
One of the most promising research directions that focus on eliminating the drawbacks of fixed, problem-independent genetic algorithms, is to look at the generation of new candidate solutions as a learning problem, and use a probabilistic model of selected solutions to generate the new ones [5,9,10]. The algorithms based on learning and sampling a probabilistic model of