Search

• Propose the concepts of line strategy (LS) and node strategy (NS) and a novel methodology adopting the decision variables of LS and NS proportions. • Impose transfer constraints explicitly and mix all the passengers with the same maximal number of transfers together. • Establish the LNS (line and node strategy) -based model on the original transit networks and reduce the scope of the feasible transfer nodes by the maximal transfer constraints. • Adopt both the method of successive averages (MSA) and a projection algorithm to solve the LNS-based model. • The performance of the LNS-based model and algorithm on a transit subnetwork of Beijing showcases its huge advantage. Passengers traveling on transit networks involve two kinds of decision-making strategies: deciding which lines are attractive at an origin or transfer node (denoted line strategy, LS), or deciding which node to transfer at when riding a line (denoted node strategy, NS). Combining these two strategies, this paper proposes a novel variational inequality formulation for the user equilibrium passenger assignment problem. The inclusion of the NS eliminates the need for passenger assignment on a large augmented graph, reducing the modeling complexity and making it easier to track all passengers' travel routes. Moreover, constraints on the maximal number of transfers—which are crucial in practical decision-making on transit networks—are explicitly included, further drastically reducing the set of passengers' feasible strategies. Furthermore, some extant strategy-based transit assignment models are shown to be a special case of the proposed model when the transfer constraint is removed. Finally, the properties of the proposed model are illustrated on a small network, and the model and algorithm exhibit huge advantages on the chosen transit subnetwork of Beijing. [ABSTRACT FROM AUTHOR]

• Spatiotemporal usage patterns of station-free shared bikes are explored. • A topic-based two-stage algorithm is proposed to discover city functional regions. • Region functions are labeled by static POI data and dynamic mobility patterns. Station-free shared bike (SFSB) is a new travel mode that shared bikes are allowed to park in any proper places. It implies that the users are more likely to park the SFSB as close as their destinations. This advantage makes the SFSB data to be an ideal source to understand the land-use distribution. Inspired by the idea in text mining, this paper proposes a topic-based two-stage SFSB data mining algorithm to understand the SFSB user's travel behavior and to discover city functional regions. A region, a function and human mobility patterns are treated as a document, a topic and words, respectively. Then, a region is represented by a distribution of functions, and a function is featured by a distribution of mobility patterns. The point-of-interest data is combined to annotate the clustered regions to discover the real functions. At last, the proposed method is tested using 14-day SFSB data in Beijing and the results are estimated by the Satellite Map data. The proposed methods and the results can be applied to infer the individual's travel purpose through functional regions and to improve land-use planning, etc. [ABSTRACT FROM AUTHOR]

Intelligent vehicles face a more complex driving environment, which requires their path planning algorithms to have the ability to respond quickly to complex environmental changes. Therefore, it is very necessary to plan the optimal path for smart vehicles in real-time. Recently, the convergence of graph dynamics and its equivalence with the shortest path solution have been proved, and the biased minimum consensus algorithm has been successfully applied to the shortest path planning problem. In this paper, considering the road conditions (degree of congestion, whether an accident occurred, etc.) and the Euclidean distance of the route, we improve biased minimum consensus algorithm to achieve optimal path planning in the complex situation of real-time updating of road conditions. In the simulation, we used the algorithm for path planning in the road topological maps of Beijing City, and compared with the RRT (Rapidly-exploring Random Trees Algorithm) algorithm and the BRRT (Bidirectional Rapidly-exploring Random Trees Algorithm) algorithm. The improved biased minimum consensus algorithm has better performance in real-time path planning problems. The research results shed new light on the real-time dynamic path planning in real traffic, which has practical significance. [ABSTRACT FROM AUTHOR]

• A reliable path finding model is proposed to minimize the fuel consumption budget. • Specified on-time arrival probability index is ensured by reliable path finding model. • A heuristic label setting algorithm is developed to exactly solve the formulated problem. • Real traffic data is applied for the applicability and efficiency verification. Transport activities are regarded as a major source of fuel consumption and CO 2 emission production. To reduce the negative impact of traffic-related CO 2 emission, this paper proposes a reliable path-finding algorithm for improving fuel efficiency in stochastic networks under the uncertainty of travel time and fuel consumption with the consideration of spatial correlation. A reliable constrained path-finding model is developed and formulated to minimize the fuel consumption budget while guaranteeing the specified on-time arrival probability. A heuristic label setting algorithm is developed to precisely solve the formulated problem. The proposed algorithm overcomes the time-consuming drawbacks of traditional path enumeration algorithms. The applicability and efficiency of the proposed algorithm are verified on real-world traffic data acquired from the Beijing and Xi'an networks in China. The experiments demonstrate that our proposed algorithm can significantly reduce fuel consumption compared to existing studies. The experiment in Beijing shows that using the proposed algorithm can reduce 0.9 kg of CO 2 emissions on average per trip compared to existing studies. [ABSTRACT FROM AUTHOR]

A new Monte Carlo transport code RMC has been being developed by Department of Engineering Physics, Tsinghua University, Beijing as a tool for reactor core analysis on high-performance computing platforms. To meet the requirements of reactor analysis, RMC now has such functions as criticality calculation, fixed-source calculation, burnup calculation and kinetics simulations. Some techniques for geometry treatment, new burnup algorithm, source convergence acceleration, massive tally and parallel calculation, and temperature dependent cross sections processing are researched and implemented in RMC to improve the efficiency. Validation results of criticality calculation, burnup calculation, source convergence acceleration, tallies performance and parallel performance shown in this paper prove the capabilities of RMC in dealing with reactor analysis problems with good performances. [ABSTRACT FROM AUTHOR]

With the boom of big data, the Internet contains more and more personal behavior information, but it is difficult to extract effectively. A model involving multivariate processing capability must be constructed to deal with these time series with complex characteristics. In this paper, a novel hybrid model embedding Baidu Search Index is therefore proposed to implement multi-step ahead subway passenger flow forecasting. Firstly, we collect data from informative Baidu Search Index, reduce dimensionality, and screen out the powerful predictors by statistical analysis. Secondly, we extract matching common modes at similar time scales between the subway passenger flow and screened Baidu Search Index via multivariate mode decomposition being optimized by multi-objective algorithm. Furthermore, to eliminate pseudo statistical causality, we select the optimal combination of modal components between subway passenger flow and its corresponding Baidu Search Index at each time scale by an innovative multi–modal analysis strategy. Thirdly, we reconstruct the forecasting values of each selected optimal combination as the final results. The empirical results of Beijing, Shanghai and Guangzhou show that the proposed model can significantly outperform six benchmark models in both the level and directional accuracy. So introducing Baidu Search Index creates a sound opportunity to enhance the subway passenger flow forecasting ability. [ABSTRACT FROM AUTHOR]

Nowadays, an increasing number of vehicle routing problem with stochastic demands (VRPSD) models have been studied to meet realistic needs in the field of logistics. In this paper, a bi-objective vehicle routing problem with stochastic demands (BO-VRPSD) was investigated, which aims to minimize total cost and customer dissatisfaction. Different from traditional vehicle routing problem (VRP) models, both the uncertainty in customer demands and the nature of multiple objectives make the problem more challenging. To cope with BO-VRPSD, a membrane-inspired multi-objective algorithm (MIMOA) was proposed, which is characterized by a parallel distributed framework with two operation subsystems and one control subsystem, respectively. In particular, the operation subsystems leverage a multi-objective evolutionary algorithm with clustering strategy to reduce the chance of inferior solutions. Meanwhile, the control subsystem exploits a guiding strategy as the communication rule to adjust the searching directions of the operation subsystems. Experimental results based on the ten 120-node instances with real geographic locations in Beijing show that, MIMOA is more superior in solving BO-VRPSD to other classical multi-objective evolutionary algorithms. [ABSTRACT FROM AUTHOR]

Abstract: Nuclear technology applications have been very important research fields in Tsinghua University (THU) for more than 50 years. This paper describes two major directions and related projects running in THU concerning nuclear technology applications for radiation imaging and nuclear technology applications for astrophysics. Radiation imaging is a significant application of nuclear technology for all kinds of real world needs including security inspections, anti-smuggling operations, and medicine. The current improved imaging systems give much higher quality radiation images. THU has produced accelerating tubes for both industrial and medical accelerators with energy levels ranging from . Detectors have been produced for medical and industrial imaging as well as for high energy physics experiments such as the MRPC with fast time and position resolutions. DR and CT systems for radiation imaging systems have been continuously improved with new system designs and improved algorithms for image reconstruction and processing. Two important new key initiatives are the dual-energy radiography and dual-energy CT systems. Dual-energy CT imaging improves material discrimination by providing both the electron density and the atomic number distribution of scanned objects. Finally, this paper also introduces recent developments related to the hard X-ray modulation telescope (HXMT) provided by THU. [Copyright &y& Elsevier]