通过定义节点编码图概念，提出一种不需要拓扑排序的求解关键路径的新算法。
A new algorithm for finding the critical paths is proposed by using coding graph and without topological sort.
引入浮动工时率的概念，提出了结合浮动工时率和网络计划工序拓扑排序的一种新的编码解码方法。
The concept of float rate was introduced. Integrating float rate with the toposorting of activities in network scheduling, a new method of coding and decoding was presented.
本文应用遗传算法，采用基于“链码”的编码方式和数学形态学的变异算子，设计了一种连续体结构拓扑优化的新方法。
A novel algorithm for topology optimization of continuum structures has been designed on the basis of "chain-code" encoding and mathematical morphologic operators.
应用推荐