Research On The Optimization Of "Door To Door" Transportation Scheme For High-speed Railway Express

As a fast,safe,high on-time,low energy consumption,round-the-clock express service,high-speed railway express has gradually become a transport product that the railway general wants to develop vigorously.At present,the cooperation between railway and express enterprises has become an increasingly common mode of transportation.The express enterprises are responsible for collecting goods and receiving the delivery service at both ends,so as to make full use of the trunk transportation resources and the advantages of time-limited transportation of high-speed railway.The "door to door" transport scheme of high-speed railway express is the basic basis for the daily cargo transport organization of transport enterprises.Therefore,this paper focuses on the optimization method of the "door to door" transport scheme of high-speed railway express,focusing on the following aspects:(1)Firstly,the characteristics of high-speed railway express products in China are analyzed.Secondly,the paper makes a detailed analysis of the operation process of "door to door" transportation organization of high-speed railway express,and abstractly describes the whole process of "door to door" transportation,laying a theoretical foundation for the subsequent construction of service network.Finally,the content of "door to door" transportation scheme for high-speed railway express is determined,and the influencing factors of "door to door" transportation scheme are analyzed.(2)The model of "door to door" dynamic space-time service network of high-speed railway express is constructed,and a k-short-circuit search algorithm adapted to the space-time service network is proposed.Before designing the path search algorithm,the pre-processing of the built basic service network is carried out,and the "door-to-door" space-time service network of high-speed railway express,which includes branch highway service and trunk railway service,is constructed.Then combined with Dijkstra algorithm and a-star algorithm based on small root heap optimization,an improved kshort-circuit by search algorithm is presented with timeliness as the core.Finally,C# programming language is used to realize the routing scheme generation algorithm.(3)The model of "door to door" dynamic space-time service network of high-speed railway express is constructed,and a k-short-circuit search algorithm adapted to the space-time service network is proposed.Before designing the path search algorithm,the pre-processing of the built basic service network is carried out,and the "door-to-door" space-time service network of high-speed railway express,which includes branch highway service and trunk railway service,is constructed.Then combined with Dijkstra algorithm and a-star algorithm based on small root heap optimization,with timeliness as the core,A k-short-circuit search algorithm adapted to the space-time service network is presented.Finally,C# programming language is used to realize the routing scheme generation algorithm.(4)Empirical analysis,the beijing-shanghai high-speed railway network,for example,in August 2019,according to its relevant operational data,build the spatiotemporal network node contains 11370 and article 35330 arc "service" service network of space and time,using the K short circuit by the search algorithm and transport plan model,obtained the needs OD routing scheme collection and capacity allocation as a result,finally analyzes the results,verify the validity of the algorithm and model.