一类整数性目标规划的遗传算法

Genetic Algorithms for a Class of Integer Linear Goal Planning

本文给出了以惩罚函数法将约束优化问题转化为无约束优化问题的通用算法,提出了将遗传算法和惩罚函数法相结合用于求解整数性目标规划问题的具体方法。计算机数值仿真结果表明了该方法的有效性。

This article gives the universal steps of transforming Constrained optimization to nonconstrained optimization by using SUMT, and proposes the specific method of combining GA with the constrained optimization method to resolve the integer linear goal planning problem in detail. A simulation result presented proves the validity of the method.