铁路行包装运方案编制方法的研究

Research on the Compilation Method for the Shipping Scheme of Railway Luggage and Parcel

根据铁路行包办理站行李车日装车计划编制流程,结合中国铁路行包运输实际情况,以车次准装区段限制、行包办理站办理限制、行包作业接续时间标准等为约束条件,给出基于行包发站和到站坐标位置网格图的行包运输径路快速算法;按照先行包直达、后1次中转和2次中转的行包装运方案编制思想,给出了多层提篮式分级筛选的铁路行包办理站装运方案编制方法。运用结果验证了方法的有效性和实用性,能够提高铁路行包运输组织的水平和运输管理质量,并且实现了铁路行包运输装运方案和日装车计划的计算机编制。

In combination with the actual conditions of railway luggage and parcel transportation in China,and according to the compilation process for daily loading plan of luggage van at station handling railway luggage and parcel,a fast algorithm for calculating the transport routing of railway baggage and parcel was proposed based on the arrow diagram marking the coordinates of luggage departure and arrival stations.The constraint conditions of the algorithm were the limits for the allowable loading section of the train number,the transaction restrictions of the station handling luggage and parcel,and the standards of the connection time for the operation of luggage and parcel,etc.The compilation method of multilayer basket-type classification screening was put forward for the shipping scheme of railway luggage and parcel at the handling station following such compilation idea of luggage and parcel shipping scheme: direct luggage and parcel first,then one-transfer luggage and parcel and finally two-transfer luggage and parcel.The application results have validated the effectiveness and practicability of the method,which can improve the organization and management level of railway luggage and parcel transportation.The computer programming of the shipping scheme as well as the daily loading plan for railway luggage and parcel transportation has been achieved.