The solutiou of the problem modeled by the new formulation is to find the shortest path between two nodes in an acyclic digraph and the computional complexity is reduced greatly in this way.

• 本文给出一个修改的模型,模型求解归结为求非循环有向图的最短路径,使问题求解大为简化。