On approach to combining genetic algorithms and accelerated probabilistic modeling algorithms
The Experience of Designing and Application of CAD Systems in Microelectronics: Proc. of the VII Int. Conf. CADMS 2003 (18-22 February 2003, Lviv-Slavske, Ukraine). – Lviv: Publ. House of Lviv Polytechnic National University, 2003. – P. 218-219.
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.