Next Article in Journal
A Robust Color Image Watermarking Algorithm Based on APDCBT and SSVD
Next Article in Special Issue
Basket-Handle Arch and Its Optimum Symmetry Generation as a Structural Element and Keeping the Aesthetic Point of View
Previous Article in Journal / Special Issue
Rainfall Runoff Analysis and Sustainable Soil Bed Optimization Engineering Process: Application of an Advanced Decision-Making Technique
Open AccessArticle

Research Methodology: Application of Railway Luggage and Package Transportation Scheme Formulation Based on a Dynamic Time–Space Service Network

by Kaige Niu 1, Jun Liu 2 and Ying Wang 2,*
1
State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China
2
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(10), 1226; https://doi.org/10.3390/sym11101226
Received: 19 August 2019 / Revised: 12 September 2019 / Accepted: 30 September 2019 / Published: 1 October 2019
(This article belongs to the Special Issue Symmetry in Engineering Sciences II)
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. View Full-Text
Keywords: railway luggage and package transport scheme formulation; transport timeliness; time–space service network; K shortest path; A* algorithm railway luggage and package transport scheme formulation; transport timeliness; time–space service network; K shortest path; A* algorithm
Show Figures

Figure 1

MDPI and ACS Style

Niu, K.; Liu, J.; Wang, Y. Research Methodology: Application of Railway Luggage and Package Transportation Scheme Formulation Based on a Dynamic Time–Space Service Network. Symmetry 2019, 11, 1226.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop