It gives the algorithm to decompose the constraint equations and the way to solve the equations in two levels based on the rules solving.
提出了对约束方程组进行分解的算法和在规则求解的基础上分两层求解方程组的方法。
2
But USES based on the breadth first algorithm, in only considered one to two time trades while the actual situation in, can the effective realization most superior way inquiry.
而采用基于广度优先算法，在只考虑一到两次换乘的实际情况下，能有效的实现最优路径的查询。
3
There are mainly two differences between the algorithm and the present clonal selection algorithm, the way of coding and mutation.