摘要：
Traffic Planning Phase Ⅳ (traffic assignment) is one of the most important steps of traffic planning.A reasonable assignment method is the key to make the future transportation system in good condition on the other hand,an optimized traffic assignment model can make transport planning correct and efficient.Classic transport planning assignment model algorithms are complex,more often,have large amount of calculation and comparison processes.However,if we use Gr(o)bner bases method on the computer in traffic assignment,it could be concise clear and easy.This paper selects the typical traffic assignment algorithm (incremental assignment method),in which improved the shortest path algorithmwithGr(o)bner bases and constructed a traffic assignment model based on Gr(o)bner bases at first,the shortest path problem in the traffic assignment model is transformed into finding a Gr(o)bner bases of polynomial sets,thenthe Gr(o)bnerbases directly obtain the traffic assignment shortest path,so that it makes the traffic assignment algorithm simple and efficient.At last the algorithm is corroborated with an instanceit means that this algorithm is feasible in engineering applications%交通规划中的第四阶段交通分配是交通规划中最重要的环节之一,合理的交通分配方法是未来规划期内交通运输系统状态良好的关键,对交通分配模型进行优化有利于交通规划正确高效.经典的交通规划分配模型算法计算复杂,比较次数多,计算量大,而Gr(o)bner基方法在计算机上容易实现,计算思路清晰简洁,适合在交通分配中采用.选取了交通分配中的典型算法增量分配法,对其中最短路算法用Gr(o)bner基方法改进,构造了基于Gr(o)bner基方法的交通分配模型.模型先将交通分配中的最短路问题转化为求多项式集的Gr(o)bner基,然后直接得出交通分配中的最短路径,使交通分配算法高效简洁.最后,为算法加以实例佐证,证实算法在工程应用中可行.
