1O一1整数规划问题的混沌遗传算法 1.1问题的提出 考虑一类0-1整数规划问题,目标函数为 min,(1lI…,1,21,…,2,…,l】…,)(1) 约束条件为’ . =1i=1,…,n(2) ≤m=1,…,n(3) ∈{0,1}(4) 1.2混沌遗传算法对于复杂非线性优化问题的求解,GA往往缺乏产生最优个体的强大能力,导致在接近全局最优...
求解0-1整数规划问题的混沌遗传算法
混沌遗传算法0-1整数规划幂函数载波片上网络通信代价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 ...