活动网络费用优化问题及其遗传算法

首先给出了活动网络费用优化问题的数学模型，并提出了用于描述活动网络工序约束关系的条件矩阵的概念，然后讨论了与费用优化问题遗传算法相关的几个问题，如可行解编码，适应度函数，迭代终止条件等，最后有示例和理论分析表明该方法明显优于网络优化问题的传统算法，尤其是在大规模的网络计算中，优势将更为显著。

COST-TIME TRADE-OFFSIN ACTIVITY NETWORKS AND ITS GENETIC ALGORITHM

The mathematics modeling of cost time trade offs for activity networks is presented,and the concept of predecessor constraints matrix is proposed which is used to represent technological precedence constraints of activity networks.Then,some problems associated with genetic algorithms for the modeling is discussed,for example,the representation,evaluation function,termination criteria,and so on.Finally,it is shown by numerical example and theoretic analysis that this method is better than traditional algorithms,and is efficient for large scale activity networks.