求解0-1二次规划的粒子群算法

先将离散的0-1变量约束转化成了不光滑方程的约束，再用磨光函数方法对其光滑化。最终，把原来的数学模型转化为可微的非线性规划问题。最后，粒子群优化算法求解-0-1 first discrete particle swarm algorithm for solving 0-1 quadratic programming variable constraint transformed into smooth equations and constraints, its smoothing function method and then polished. Eventually, the original mathematical model into differentiable nonlinear programming problem. Finally, the particle swarm optimization algorithm