求解0-1整数规划问题的混沌遗传算法

摘要

This paper proposed a chaos genetic algorithm for a special class of 0-1 integer programming problem. First, im-proved the adequacy and ergodicity of chaotic search by using the power function carrier technology, then, used the optimal in-dividual derived from chaotic search algorithm as a new population of genetic algorithm to make crossover and mutation opera-tions , 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 A3 MAP (architecture-aware analytic mapping) model. Simulation results show that the convergence speed and the accuracy of value is superior to A3MAP-CA.%针对一类特殊的0-1整数规划求解问题提出一种混沌遗传算法.该算法采用幂函数载波技术提高混沌搜索的充分性与遍历性,以混沌搜索算法得出的优化个体作为遗传算法的新群体进行交叉、变异等操作,提高种群质量,同时增加种群多样性,改善遗传算法的早熟问题.该算法被用于解决片上网络映射A3 MAP( architecture-aware analytic mapping) 0-1整数规划问题.实验仿真证明,该算法的收敛速度和解的精度均优于A3MAPGA.