论文部分内容阅读
一、一个多年来未解决的问题 扇形分布的专用线,当各专用线无残存车时,由一台调车机车送取车方案有多少种?(以下简称专用线送取车方案),这一问题很早就提出来了。50年代马许教授在《车站与专用线在统一技术作业过程中相互配合条件之研究》(注)中提出: 方案的数目(J)根据参加作业的专用线数目(x)是这样的: 当x=2 所有方案=4 〃x=3 〃=36 〃x=4 〃=576 〃x=5 〃=14400等等 一般情况下,方案数目可按下列公式求出: J=〔x(x-1)(x-2)……1〕~2或是J=〔x!〕~2
First, a problem that has not been solved over the years Fan-shaped distribution of dedicated lines, when the special line without remnants of cars, by a shunting locomotive to take the car program how many? (Hereinafter referred to as dedicated line to send car program), which A problem is raised long ago. In the 1950s, Prof. Mark Hsu proposed in “Research on Conditions of Mutual Cooperation between Stations and Special Lines in Uniform Technical Operations” (Note): Number of Programs (J) According to the number of dedicated lines (x) participating in the operation, x = 4 〃 = 36 〃x = 4 〃 = 576 〃x = 5 〃 = 14400, etc. Under normal circumstances, the number of programs can be obtained according to the following formula: J = 〔x (x- 1) (x-2) ... 1] ~ 2 or J = [x!] ~ 2