多目标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.%多目标问题在现实中有广泛应用,如何获得更多非劣解具有重要意义.通过利用混沌运动的遍历性、随机性、规律性等特点,设计了一种求解多目标0-1规划问题的混沌优化算法,并在计算机上予以实现.该混沌优化算法计算时间复杂度较小,在计算效率上有一定优势.计算结果表明,与已有算法相比,该算法能求得较多非劣解,能够有效求解多目标0-1规划问题.