In recent years, although rail transport has contributed significantly to the productivity of the Chinese economy, it has also been faced with the fierce competition and challenge from other modes of transportation, and therefore, freight-pricing issue has received more attention by researchers. In this paper, the rail freight option (RFO) based on option theory is proposed to study the optimal pricing decision of the railway transportation enterprise and contract customers’ optimal purchase decisions. To obtain an effective RFO contract, the railway freight contract transaction process is first analyzed. Then, the theoretical framework for the RFO contract trading is put forward in the railway freight market. Next, a two-stage Stackelberg game theoretic approach is presented based on the principle of utility maximization to achieve the optimal decision of RFO contract. Subsequently, the reverse reasoning method in dynamic programming is used to solve the optimal combination decision of the contract customer. Finally, the optimal pricing decision of RFO is discussed using Kuhn–Tucker conditions and Lagrangian function. The result shows that the railway transportation enterprise should pay more attention to the option strike price in terms of maximizing system utility and achieving Pareto optimal.
26 November 2018 in Neural Computing and Applications
Purpose: Density-based spatial clustering of applications with noise (DBSCAN) is the most commonly used density-based clustering algorithm, while it cannot be directly applied to the railway investment risk assessment. To overcome the shortcomings of calculation method and parameter limits of DBSCAN, this paper proposes a new algorithm called Improved Multiple Density-based Spatial clustering of Applications with Noise (IM-DBSCAN) based on the DBSCAN and rough set theory.Design/methodology/approach: First, the authors develop an improved affinity propagation (AP) algorithm, which is then combined with the DBSCAN (hereinafter referred to as AP-DBSCAN for short) to improve the parameter setting and efficiency of the DBSCAN. Second, the IM-DBSCAN algorithm, which consists of the AP-DBSCAN and a modified rough set, is designed to investigate the railway investment risk. Finally, the IM-DBSCAN algorithm is tested on the China–Laos railway's investment risk assessment, and its performance is compared with other related algorithms.Findings: The IM-DBSCAN algorithm is implemented on China–Laos railway's investment risk assessment and compares with other related algorithms. The clustering results validate that the AP-DBSCAN algorithm is feasible and efficient in terms of clustering accuracy and operating time. In addition, the experimental results also indicate that the IM-DBSCAN algorithm can be used as an effective method for the prospective risk assessment in railway investment.Originality/value: This study proposes IM-DBSCAN algorithm that consists of the AP-DBSCAN and a modified rough set to study the railway investment risk. Different from the existing clustering algorithms, AP-DBSCAN put forward the density calculation method to simplify the process of optimizing DBSCAN parameters. Instead of using Euclidean distance approach, the cutoff distance method is introduced to improve the similarity measure for optimizing the parameters. The developed AP-DBSCAN is used to classify the China–Laos railway's investment risk indicators more accurately. Combined with a modified rough set, the IM-DBSCAN algorithm is proposed to analyze the railway investment risk assessment. The contributions of this study can be summarized as follows: (1) Based on AP, DBSCAN, an integrated methodology AP-DBSCAN, which considers improving the parameter setting and efficiency, is proposed to classify railway risk indicators. (2) As AP-DBSCAN is a risk classification model rather than a risk calculation model, an IM-DBSCAN algorithm that consists of the AP-DBSCAN and a modified rough set is proposed to assess the railway investment risk. (3) Taking the China–Laos railway as a real-life case study, the effectiveness and superiority of the proposed IM-DBSCAN algorithm are verified through a set of experiments compared with other state-of-the-art algorithms.
In this study, we demonstrate the importance of incorporating shippers’ preference heterogeneity into the optimization of the China Railway express network. In particular, a bilevel programming model is established to minimize the total construction cost for the government in the upper level and maximize the shippers’ satisfaction in the lower level. The proposed model considers price, time, reliability, frequency, safety, flexibility, traceability, and emission. Two designs are obtained by applying the model to two scenarios, in which one is of the aggregate shipper group and the other is of the three distinct clusters. Results show that explicitly including heterogeneity in network optimization pays off in terms of the dramatic increase in shippers’ satisfaction and the share of the sustainable railway without generating extra cost for the system. The results of this study could lead to insightful implication for proper network planning for the China Railway express and some useful suggestions on the subsidies of the government.
8 March 2021 in Discrete Dynamics in Nature and Society
For railway freight pricing, this paper proposes a new tradable rail freight option (RFO). A multiphase trigeminal tree pricing model is established to analyze the optimal pricing decision of RFO. The main parameters of the model are identified theoretically through nonparametric Ito stochastic approach. The paper expands the theory of railway freight pricing. The aim of this paper is to construct the railway freight option theory to help railway transportation enterprise cope with fierce competition and challenge from other modes of transportation in China. The most significant feature of this method is its simplicity in analyzing the optimal pricing decision using only the algebraic category and Ito’s lemma.