On approach to combining genetic algorithms and accelerated probabilistic modeling algorithms
作者
L. Hulianitsky,Alexey Turchin
标识
DOI:10.1109/cadsm.2003.1255037
摘要
This article illustrates one possible approach to design algorithms solving different combinatorial optimization problems. The main idea is in implementing accelerated probabilistic modeling algorithm into genetic algorithm scheme as mutation operator. Proposed novel hybrid algorithm was tested on a number of benchmark problems, results comparison was made.