摘要
提出了用遗传算法构造求解无交叉约束类二次０－１规划模型的方法，给出了具体步骤及实验。结果表明此法求解速度理想，易达最优解，可以处理较大规模的问题。
A method to solve nonintersection constraint 01 quadratic programming model with genetic algorithm(GA) is established. The detailed procedure and numerical experiment of the GA are described. The computational results show that the optimal solutions could be obtained easily and fast. It is also suitable for solving large scale problems. A wide application of the method is expected.
出处
《西南交通大学学报》
EI
CSCD
北大核心
1997年第6期667-671,共5页
Journal of Southwest Jiaotong University
关键词
0-1规模
遗传算法
系统工程
二次规划
1 planning
genetic algorithms
optimization
system engineering
