Abstract

In the current market environment, the formulation of a railway luggage and package transport scheme (RLPTS) is often affected by the specific requirements of the transport organization, the complex composition of the transport service network, and the dynamic changes of transport demands, which make it very difficult. In this paper, a two-stage RLPTS formulation method is proposed that can meet not only transport demands with dynamic changes, but also the requirements of transport timeliness. It is used to solve the problem of current RLPTS formulation. First, a dynamic service network for railway luggage and package transport (RLPT) is constructed based on passenger train schedules, and based on this network, an improved A* algorithm is designed to generate feasible path sets for RLPT demand. Then, based on feasible path sets, a flow distribution model aiming at maximizing the total profit of transportation is established to solve the model in order to enable the flow allocated on the path. Finally, an example calculation shows that the method can implement the RLPTS formulation rapidly.

Highlights

  • In recent years, with the development of China’s e-commerce logistics, the improvement of the railway network, the speeding up of the railway, and the development of freight business, the proportion of express railway in China’s capacity structure has increased, and railway capacity has become one of the future directions for express delivery

  • We decomposed the railway luggage and package transport scheme (RLPTS) formulation problem into subproblems, one of which was the construction of a dynamic time–space service network based on passenger train schedules and demand information

  • The other subproblem involved subproblems, one of which was the construction of a dynamic time–space service network based on passenger train schedules and demand information

Read more

Summary

Introduction

With the development of China’s e-commerce logistics, the improvement of the railway network, the speeding up of the railway, and the development of freight business, the proportion of express railway in China’s capacity structure has increased, and railway capacity has become one of the future directions for express delivery. This amalgamation makes up for the poor timeliness of railway logistics door-to-door business distribution at both ends, but the commitment to creating door-to-door product cooperation still requires seamless connection at both ends of the distribution service At present, this is a very common mode of transport, but what restricts its development is the formulation of railway luggage and package transport schemes (RLPTSs) from station to station. [4], but it does not consider the loading and unloading capacity constraint of stations, which is important to ensure the usability of the results Since goods have both time and space information in the whole transportation process, we intend to construct a dynamic time–space service network to study the timeliness of transporting goods. Based on the theory and method of service networks, we studied the factors that affect RLPT optimization and established an optimization model with maximum transportation revenue to solve the problem of implementing RLPTS.

Literature Review
Construction of Dynamic Time–Space Service Network
Principles and Restrictions of Path Search
Preprocessing of Dynamic Time–Space Service Network before Path Search
Assumptions and Parameter Descriptions
Objection Function
Constraint Conditions
Evaluation Indices
Empirical Studies
Related Parameter Values
Parameter Values in Path Search Algorithm
Freight Rates and Costs in the Model
Results and Discussion
Proportion
Result Comparison
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call