0-1非线性规划问题改进的教与学优化算法

摘要

The zero-one nonlinear programming problems is converted constrained optimization problems,an improved teach?ing-learning-based optimization(ITLBO)for solving the zero-one nonlinear programming is proposed using dynamic bi-objection constraint-handling method and modifying the iterative equation of TLBO algorithm. Simulation results show that ITLBO is effective?ness in terms of convergence speed and global optimization ability.%将0-1非线性规划问题转化为约束优化问题,采用动态双目标的约束处理方法,对教与学优化算法的迭代方程进行改进,提出了一种求解0-1非线性规划问题的改进教与学优化算法.数值实验表明,新算法具有较快的收敛速度和较好的全局寻优能力,显示了算法的有效性和通用性.