摘要
对于带有线性约束的多目标0-1规划问题,给出了一种自适应的粒子群优化算法。该算法利用变换来控制模型的线性约束,并通过对各目标函数进行自适应加权的方式形成适应度函数。数值结果表明该算法是有效的,可以求解实际应用中的一些模型。
In order to solve the problem of multi-objective 0 - 1 programming with linear constrains, we present an adaptive particle swarm optimization algorithm. This algorithm uses the transformation to control the linear constrains in the model, and by calculating the objective functions＇ weights with the method of adaptive change to form the fitness function. It is shown by the numerical result that this algorithm is effective and can find solution for some models in practical application.
出处
《计算机应用与软件》
CSCD
2009年第12期71-72,124,共3页
Computer Applications and Software
基金
国家社会科学基金项目(07XJY038)
宁夏自然科学基金项目(NZ0848)
关键词
多目标
非线性0-1规划
粒子群优化算法
Multi-objective Non-linear 0 - 1 programming Particle swarm optimization algorithm
