基于LINGO的交通流量最大总费用最小的算法

Algorithm for Minimum Cost but for Maximum Trafffic Flow Based on LINGO

在交通流量分配过程中,目标模型为交通流量最大费用最小,模型的传统求解迭代次数太多,往往比较复杂。介绍了LINGO算法,通过一个算例证明该算法是切实可行的。

The distribution process of traffic flow, the target model aims at the minimum cost, but for the maximum traffic flow. The traditional solution to the model was very complex because of so many direct iterations. The LINGO algorithm was described, finally, a case was provided to have illustrated that the application of the proposed method was practicable.