论文部分内容阅读
本文研究如何利用电子计算机计算单组技术直达列车编组计划的方法。建立了综合计算法的数学模型,即在绝对计算法的基础上,利用有利到达站数对方案进行大量删除之后,对余下方案逐站逐支车流采取一竿到底的计算方法。文中较为详细地介绍了如何把这种方法在电子计算机上付诸实现,并有详细的计算框图和七个支点站的程序设计之例。这种方法的特点是能够大大地节省计算时间,并准确地选出最优方案和一批次优方案。在 DJS—131计算机(速度为每秒50万次)上实践的结果,选出七个支点站的最优和一批次优编组方案,总共才花了2分半钟,而对全部可能方案——计算只需40多分钟。
This article studies how to use the computer to calculate the method of direct train marshalling plan. The mathematic model of the comprehensive calculation method is established, that is, on the basis of the absolute calculation method, after a large number of schemes are deleted by using the number of favorable arrival stations, a pole-by-pole calculation method is adopted for each of the remaining solutions. This paper describes in detail how to put this method into practice on the computer, with a detailed calculation block diagram and programming examples of the seven fulcrum stations. This method is characterized by significant savings in calculation time and accurate selection of the optimal solution and a number of suboptimal solutions. As a result of practicing on the DJS-131 computer at a speed of 500,000 times per second, it took a total of two and a half minutes to select the optimal and a group of optimal grouping schemes for the seven fulcrum stations, and for all possible solutions - Calculate in just 40 minutes.