Today efficient traffic management seems to be impossible without the support of the artificial intelligence systems based on mathematical models of traffic flow assignment since a modern road network is a large-scale system with huge amounts of elements. The present paper is devoted to the route-flow traffic assignment problem, which solution is the most valuable from decision-making perspectives. The paper aims to fill the gap in the relation between the column generation process and the uniqueness of the equilibrium route-flow traffic assignment pattern. The independence of routes is showed to be highly significant when travel time functions are arc-additive. Indeed, on the one hand, the independence of routes is proved to guarantee the uniqueness of the equilibrium route-flow traffic assignment pattern. On the other hand, the independence of routes appears to be crucial for column generation when solving the route-flow traffic assignment problem since the equilibrium travel time is proven to be decreased only by adding independent candidate route. Obtained results contribute to the development of algorithms for route-flow traffic assignment based on travel times equilibration procedure.

如今，如果没有基于交通流分配数学模型的人工智能系统的支持，高效的交通管理似乎已成为不可能，因为现代道路网络是一个包含大量元素的大规模系统。本文专门针对路线流交通分配问题，从决策角度来看，该解决方案是最有价值的。本文旨在填补列生成过程与平衡路径-流量分配模式的唯一性之间关系的空白。当行程时间函数是弧加性时，路线的独立性被证明是非常重要的。的确，一方面，证明了路线的独立性可确保平衡路线-流量交通分配模式的唯一性。另一方面，在解决路线流量分配问题时，路线的独立性对于列生成至关重要，因为事实证明，仅通过添加独立的候选路线，平衡行驶时间会减少。获得的结果有助于开发基于行程时间均衡程序的路线流交通分配算法。