Chaos genetic algorithm for solving 0-1 integer programming problem
Тао Чен · Jisuanji yingyong yanjiu · 2011
This paper proposed a chaos genetic algorithm for a special class of 0-1 integer programming problem.First,improved the adequacy and ergodicity of chaotic search by using the power function carrier technology,then,used the optimal individual derived from chaotic search algorithm as a new population of genetic algorithm to make crossover and mutation operations,which could improve the population quality and diversity and solve premature problem.Used the algorithm to solve the 0-1 integer programming problem of network-on-chip A3MAP(architecture-aware analytic mapping) model.Simulation results show that the convergence speed and the accuracy of value is superior to A3MAP-GA.