论文部分内容阅读
主要研究了铁路网上车流径路的选择优化问题．在充分考虑到真实路网中的车流具有不同权重的情况下，建立了该问题的０－１规划模型．并讨论了带权重与不带权重两种车流径路优化模型之间的关系．此外，还给出了路网上任意两节点之间可能路径集的确定准则及算法．最后探讨了在给定Ｏ－Ｄ矩阵下，路网中存在一处或多处瓶颈时，关于不可行流的处理方法
Mainly studied the selection and optimization of the railway traffic flow on the Internet. Taking fully into account the traffic flow in the real road network with different weights, a 0-1 programming model for this problem is established. And discusses the relationship between the optimization model of traffic flow with and without weight. In addition, the rules and algorithms for determining the set of possible paths between two arbitrary nodes on the road network are also given. In the end, we discuss how to deal with infeasible flow when there is one or more bottlenecks in the road network under a given O-D matrix