Chaotic optimization algorithm for multi-objective 0-1 programming problem
多目标0-1规划的混沌优化算法

As multi-objective problems boast wild application, how to obtain more Pareto solutions plays a significant importance. By employing the specific features of ergodicity, randomness and regularity of chaotic motion, this paper developed a chaotic optimization algorithm with low time complexity and the advantage of high computational efficiency and implemented on computer for solving the multi-objective 0-1 programming problem. Numerical experiments show that this chaotic optimization algorithm can solve the multi-objective 0-1 programming problem effectively, and can get more Pareto solutions than other algorithms proposed before.