论文部分内容阅读
我們小組在調查研究循环运輸的工作中,应用了一种綫方程組的方法,来从最优解决定循环路綫,今介紹給讀者,并与北大数学专业运輸战斗小組討論。按北大的方法(见本刊1958年第10期),设有m个装貨站A_1,A_2,……,n个卸貨站B_1,B_2,…,B_n,并設A_i→B_j所需要运輸的貨物的数量是T_(ij),其单位是吨(或車次),命x_(ij)为某个完成这一組貨运任务的循环运輸計划中Bj→Ai的空車的数量,其单位是吨(或車次),則可列出下列綫方程組:
Our team applied a linear equations method to investigate and study the cyclical transportation, to solve the optimal recurrence route, introduce it to the readers today, and discuss it with the Peking University mathematics professional transportation combat team. According to Peking University’s method (see issue No. 10 of 1958 of this publication), there are m loading stations A_1, A_2, ..., n loading stations B_1, B_2, ..., B_n, and A_i → B_j are set to be transported. The quantity of goods is T_(ij), the unit is tons (or trains), and the life x_(ij) is the number of empty cars of Bj → Ai in a recirculating transportation plan to complete this group of freight tasks. If the unit is tons (or trains), the following line equations can be listed: