在计算车流径路时，铁路环状图的存储是最重要、最复杂的部分。
An efficient store method of the railway network is the most important and complex in calculating the wagon routing.
归纳铁路车流径路制定过程中和自动化系统中应用车流径路的数学问题。
The mathematical problems in car flow routing are concluded both for setting up the routing and automatic system.
车流径路和编组方案统一起来进行优化，会得到更加精确和合理的结果。
It is pointed out that an exact and rational result can be obtained by joint optimization of car flow routing and marshalling plan.
由此可将给定编组去向集时有改编能力约束的编组计划问题转化为车流径路问题来解决。
Hence, the train formation plan, given a group of formations, with the constraint of marshalling capacity can be transformed into a wagon path problem.
揭示了铁路枢纽编组站分工问题可以分解为车流在枢纽内作业地点的选择和走行径路的选择两个层次。
This paper reveals that the problem for division of labor of yards in a railway hub can be decomposed as two levels, which are operation site choice and route choice in the hub.
揭示了铁路枢纽编组站分工问题可以分解为车流在枢纽内作业地点的选择和走行径路的选择两个层次。
This paper reveals that the problem for division of labor of yards in a railway hub can be decomposed as two levels, which are operation site choice and route choice in the hub.
应用推荐