Title :
On approach to combining genetic algorithms and accelerated probabilistic modeling algorithms
Author :
Hulianitsky, L. ; Turchin, A.
Abstract :
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.
Keywords :
computational complexity; genetic algorithms; simulated annealing; travelling salesman problems; accelerated probabilistic modeling algorithm; algorithms design; benchmark problems; combinatorial optimization problems; computational expenditures; genetic algorithms; hybrid algorithm; mutation operator; quadratic assignment problem; simulated annealing; traveling salesman problem; Acceleration; Algorithm design and analysis; Benchmark testing; Cities and towns; Design optimization; Genetic algorithms; Genetic mutations; Optimization methods; Simulated annealing; Traveling salesman problems;
Conference_Titel :
CAD Systems in Microelectronics, 2003. CADSM 2003. Proceedings of the 7th International Conference. The Experience of Designing and Application of
Print_ISBN :
966-553-278-2
DOI :
10.1109/CADSM.2003.1255037
