论文部分内容阅读
提出了不成对机车周转图的一种铺画方法,在机车折返站,运用网络流模型确定出不成对机车周转图上满足最优化要求的基本成对机车周转图方案,为未获指派的机车就近勾画交路。在基本段所在站,将附挂回送机车的运行线在该站的运行时刻插入相应的时刻序列,将基本段所在站不成对机车周转图问题转化为成对机车周转图问题,利用表上寻优算法求解成对机车周转图交路方案。分析结果表明:对不成对系数为0.78、两端站机车停留时间标准相同的机车周转图,计算得到机车在基本段所在站总停留时间与折返段所在站总停留时间之比不小于1.25,该算法将机车在折返段的额外停留时间最大限度地转移到基本段,满足了机车在折返站紧凑折返的要求。
An unpaired motorcycle turnaround diagram is presented. A basic pairwise locomotive turnaround plan that meets the optimization requirements on the turnaround map of unpaired locomotives is determined by using the network flow model at the turnaround point of the locomotive, and an unpaired locomotive Map nearby hand over. At the station where the basic section is located, the operation line of the attached return locomotive is inserted into the corresponding time sequence at the running moment of the station, the problem of the unaccountable locomotive turning diagram of the station where the basic section is located is converted into a pair of locomotive turning diagram problem, Optimal Algorithm to Solve Pairs of Locomotive Turnaround Plan. The analysis results show that the ratio of locomotive locomotive to locomotive locomotive at the station where the locomotive is located is equal to or less than 1.25, The algorithm transfers the extra stay time of the locomotive in the turning-back section to the basic section to the maximum extent, which meets the requirements of compact locomotive turning-back station.