铁路行包运输径路算法

针对铁路行包运输网络和运输组织的特征,遵循长短途分工、始发直达、区域中转等铁路行包运输组织基本原则,以营业站和列车运行模式对铁路行包运输网络进行描述;综合考虑运输成本、时间、能力和现场作业等方面因素,给出铁路行包运输径路的基本形式和选择策略,并设计基于选择策略的铁路行包运输径路搜索算法,实现对装车站以及中转站列车的合理选取,有效减少选用列车的数量,提高搜索的效率和有效性。通过限定最大搜索次数对铁路行包运输径路算法的搜索深度进行有效控制;搜索广度主要由可选用的列车数决定。该算法可以完成给定装车站到所有营业站的径路计算,应用于中铁快运公司1 000多个行包营业站、1 600多列列车的大规模铁路行包运输网络的运输径路计算,效果良好。

Algorithm for the Railway Baggage and Parcel Transportation Routing

The network for railway baggage and parcel transportation is described in terms of the business stations and train operation modes according to the characteristics of railway baggage and parcel transportation network as well as the transportation organization,following such basic rules as long and short distance division,nonstop from departure,and regional transfer,etc.The basic form of routing and the selection strategy for railway baggage and parcel transportation are presented by comprehensively considering different factors: the transportation cost,time,capacity and field operation,etc.Based on the selection strategy,a routing search algorithm is developed for railway baggage and parcel transportation to realize the rational selection of trains at the loading stations and transfer stations.Consequently,the number of trains to be used is effectively reduced,and the efficiency and the effectiveness of searching are improved.The searching depth of the routing algorithm is controlled effectively by limiting the maximum searching times.The searching breadth is mainly decided by the number of trains to be selected.The algorithm is available to calculate the package shipment routing from one give loading station to all business stations. The results using the real operating data from China Railway Express Limited Company,which include more than 1 000 business stations and 1 600 trains,show that the algorithm is effective and can be useful for actual operations.