考虑技术站编组去向的车流径路优化研究

Traffic Routing Optimization Considering Train Destinations of Technical Stations

在车流径路规划中,相同到站的车流经同一技术站改编后合并。研究旨在提出一种考虑技术站编组去向的车流径路优化模型,以克服现有车流径路模型中车流相遇即合并的限制。构建反映技术站间编组去向的网络G1,G1中的每条边与实际路网G2对应顶点间的最短路绑定。以路网G2上车流的广义走行费用最小为目标,考虑技术站的流量守恒、改编能力以及区间通过能力等约束条件,构建一个整数规划模型。为求解该模型,采用模拟退火算法,使用惩罚函数处理容量约束。根据相同终点车流在G1相遇即合并的特点生成初始解,通过随机改变某股车流的径路生成新的解,且确保终点相同的车流仍满足相遇即合并的条件。通过算例对比研究提出的模型与传统的“树形径路”模型,验证模型的有效性和合理性。

In traffic routing planning,multiple traffic flows arriving at the same station can be merged after reconfiguration at the same technical station.This paper is intended to propose a traffic routing optimization model considering train destinations between technical stations to overcome the limitations on traffic flows’merging upon meeting in the existing traffic routing optimization models.In this paper,the network G1 was constructed to represent the train destinations between technical stations,with each edge associated with the shortest path between corresponding vertices in the railway network G2.With a view to minimizing the generalized travel cost of the flow path on the railway network G2,considering such constraints as flow conservation,sorting capacity,and carrying capacity of sections,an integer programming model was constructed accordingly.To solve this model,a simulated annealing algorithm was employed,with a penalty function used to handle capacity constraints.Considering the traffic flows with the same destination merge upon meeting in the network G1, an initial solution was generated, and new solutions generated by randomly changing the path of a particular flow while ensuring that traffic flows with the same destination still merge upon meeting. The effectiveness and rationality of the model was validated by comparing it with the traditional “tree-shape route” optimization model through numerical examples.