Differential pricing of trains with different departure times caters to the taste heterogeneity of the time-dependent (departure time) demand and then improves the ticket revenue of railway enterprises. This paper studies optimal differential pricing for intercity high-speed railway services. The distribution features of the passenger demand regarding departure times are analyzed, and the time-dependent demand is formulated; a passenger assignment method considering departure periods and capacity constraints is constructed to evaluate the prices by simulating the ticket-booking process. Based on these, an optimization model is constructed with the aim of maximizing the ticket revenue and the decision variables for pricing train legs. A modified direct search simulated annealing algorithm is designed to solve the optimization model, and three random generation methods of new solutions are developed to search the solution space efficiently. Experimental analysis containing dozens of trains is performed on Wuhan-Shenzhen high-speed railway in China, and price solutions with different elastic demand coefficients () are compared. The following results are found: (i) the optimization algorithm converges stably and efficiently and (ii) differentiation is shown in the price solutions, and the optimized ticket revenue is influenced greatly by , increasing by 7%–21%.

In order to enhance the real-time and retrieval performance of road traffic data filling, a real-time data filling and automatic retrieval algorithm based on the deep-learning method is proposed. In image detection, the depth representation is extracted according to the detection target area of a general object. The local invariant feature is extracted to describe local attributes in the region, and it is fused with depth representation to complete the real-time data filling of road traffic. According to the results of the database enhancement, the retrieval results of the deep representation level are reordered. In the index stage, unsupervised feature updating is realized by neighborhood information to improve the performance of a feature retrieval. The experimental results show that the proposed method has high recall and precision, a short retrieval time and a low running cost.

Good track geometry state ensures the safe operation of the railway passenger service and freight service. Railway transportation plays an important role in the Chinese economic and social development. This paper studies track irregularity standard deviation time series data and focuses on the characteristics and trend changes of track state by applying clustering analysis. Linear recursive model and linear-ARMA model based on wavelet decomposition reconstruction are proposed, and all they offer supports for the safe management of railway transportation.

The analyzing and processing of multisource real-time transportation data stream lay a foundation for the smart transportation's sensibility, interconnection, integration, and real-time decision making. Strong computing ability and valid mass data management mode provided by the cloud computing, is feasible for handlingSkylinecontinuous query in the mass distributed uncertain transportation data stream. In this paper, we gave architecture of layered smart transportation about data processing, and we formalized the description about continuous query over smart transportation dataSkyline. Besides, we proposedmMR-SUDSalgorithm (Skylinequery algorithm of uncertain transportation stream data based onmicro-batchinMap Reduce) based on sliding window division and architecture.

A new measurement method is proposed to calculate spatio-temporal trajectory similarity, which can reflect the similar degree between two moving object spatio-temporal trajectories compressed by the Maximal Bounding Boxes (MBB). Firstly, the similarity between two trajectories is replaced by the similarity of MBB sequences in respective trajectories which can dramatically decrease the storage volume of the trajectory data. Secondly, some factors affected the similar degree of MBB sequences are analyzed systematically, such as the time duration of overlap between two MBBs in different trajectories, space distance and the density of data points inside the boxes. And then, a similarity measurement formula is proposed by integrating these factors. Experiments show that the proposed measurement formula can improve the value of clustering index Dunn.