Transportation Research Part C-Emerging Technologies最新文献

{"title":"Routing of autonomous vehicles for optimal total system cost under equilibrium","authors":"Faizan Ahmad Kashmiri,&nbsp;Hong K. Lo,&nbsp;Yue Huai,&nbsp;Zheng Liang,&nbsp;Lubing Li","doi":"10.1016/j.trc.2025.105004","DOIUrl":"10.1016/j.trc.2025.105004","url":null,"abstract":"<div><div>The notion of optimal mobility via Autonomous Vehicles (AVs) controlled by a transportation management centre (TMC) has received considerable attention in the past few years. One of the novel demand management strategies entails Average Travel Time (AVT) equilibrium, a cyclic path assignment that travellers experience at the end of a fixed cycle (a period of many days) while maintaining system optimal (SO) path flows every day. However, this work is restricted to smaller networks because of the intricate solution strategies involved. To address large networks in notably lower run times, we thus put forth a linear-based AVT approach. Furthermore, applying such TMCs is limited to system time only, with system emissions receiving negligible attention. In this regard, we propose a TMC that preserves an optimal total system cost (OTSC), including travel time and emission. Unlike earlier AVT works, the average vehicle travel time and emission cost (AVTEC) equilibrium is converted from a non-linear complementarity problem to a linear problem by manipulating the inherent structure of the problem. Similar to AVT, when a fixed cycle ends, travellers from the same Origin-Destination (OD) pair will have taken distinct routes within a given path combination set in accordance with predetermined time proportions and experience equal and minimal AVTEC. Numerical investigations demonstrate that, in contrast to previous approaches to AVT, the novel linear AVTEC framework can solve extended networks significantly faster. We also investigate the mixed equilibrium (ME) scenario, in which specific travellers (referred to as non-subscribers) who choose not to subscribe to the TMC but adhere to their user equilibrium (UE) routing patterns and compete with the OTSC travellers. Results indicate that the non-subscribers will outperform the subscribers, giving non-subscribers incentives to not join the TMC. To deter this from occurring, we determine tolls upon non-subscribers/UE travellers based on the travel cost difference (TCD) between the AVTEC of TMC subscribers and the minimum UE travel cost of non-subscribers. While imposing tolls upon UE travellers, we consider their heterogeneity through their value-of-time (VOT) distribution to equalize the minimum private costs of non-subscribers with the AVTEC of subscribers. In addition, we propose link-based and sensitivity-based equilibrium strategies regarding ME, tolls and different penetration rates of subscribers and non-subscribers based on their VOT distribution to solve extensive networks.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 105004"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Single-stage train formation in railway marshaling stations under an extended railcar-to-track assignment policy","authors":"Siyu Zhang ,&nbsp;Jun Zhao ,&nbsp;Bojian Zhang ,&nbsp;Jiaxi Zhao ,&nbsp;Qiyuan Peng","doi":"10.1016/j.trc.2024.104972","DOIUrl":"10.1016/j.trc.2024.104972","url":null,"abstract":"<div><div>This paper studies a single-stage train formation problem in railway marshaling stations, aiming to efficiently assign railcars to classification tracks with one roll-in and one pull-out operation for ensuring the formation of outbound trains. Assigning railcars to classification tracks by blocks (block-to-track), by outbound trains (train-to-track), and by need (railcar-to-track) are three typical policies widely addressed in the literature. An extended railcar-to-track policy is investigated by combining the first and third policies, where railcars are preferentially assigned to their fixed-use classification tracks through a specified block-to-track scheme and then to other classification tracks if necessary, while re-humping and re-sorting operations are eliminated. We formulate the formation problem under this policy as a binary linear programming model with the objective of minimizing the total weighted cost required for train formation, including both the weighted roll-in cost and the weighted pull-out cost. A two-phase decomposition algorithm, which divides our model into a roll-in and a pull-out subproblem, is developed to improve the solving efficiency. For the roll-in subproblem, a novel group-indexed model is constructed to determine a railcar-to-track scheme with minimal total weighted roll-in cost and simplified pull-out cost. For the following pull-out subproblem, the objective is to determine a pull-out scheme that minimizes the total weighted pull-out cost. This subproblem is decomposed further into multiple simplified problems, each of which is formulated into a quadratic assignment model for each outbound train, enabling rapid solving times of this subproblem. Computational results on a set of realistic instances reveal that our algorithm outperforms two benchmark approaches, in which the roll-in subproblem is formulated respectively as a big-M and an arc-indexed model inspired by existing models, and an imitated empirical approach used in practice. The potential superiority of our proposed policy to the three existing policies is also numerically validated.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 104972"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Prediction of traffic state variability with an integrated model-based and data-driven Bayesian framework","authors":"Xinyue Wu ,&nbsp;Andy H.F. Chow ,&nbsp;Wei Ma ,&nbsp;William H.K. Lam ,&nbsp;S.C. Wong","doi":"10.1016/j.trc.2024.104953","DOIUrl":"10.1016/j.trc.2024.104953","url":null,"abstract":"<div><div>Deriving statistical description of uncertainties associated with prediction of traffic states is essential to development of reliability-based intelligent transportation systems. This paper presents a Bayesian learning approach framework for predicting evolution of both traffic states and the associated variability. The proposed framework ensures the interpretability and stability of the predictions with an underlying state space model, and captures sophisticated dynamics of traffic variability via a data-driven recurrent neural network component. By maintaining the filtering structure in the specialized neural network component, the proposed integrated model overcomes the key limitations of deep learning systems by improving the data efficiency and providing interpretability. The framework is trained with a multivariate Gaussian negative log-likelihood loss function for quantifying both model and stochastic uncertainties. It is implemented and tested with actual traffic data collected from a Hong Kong Strategic Route. The case study shows that the proposed prediction framework can simultaneously retain the interpretability of the results while capture the complex dynamics of the evolution of traffic variability with the recurrent neural network component. This study contributes to the development of reliability-based intelligent transportation systems through the use of advanced statistical modeling and deep learning methods.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 104953"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143095591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multi-node joint optimization for fine-grained vehicle trajectory reconstruction using vehicle appearance and identity data","authors":"Mingkai Qiu ,&nbsp;Yuhuan Lu ,&nbsp;Xiying Li","doi":"10.1016/j.trc.2024.104995","DOIUrl":"10.1016/j.trc.2024.104995","url":null,"abstract":"<div><div>Automatic vehicle identification (AVI) data provides information about vehicles’ identity and location, which enables accurate vehicle trajectory extraction. However, collecting complete and continuous long-term trajectory data is challenging due to limitations in coverage rate and identification accuracy. To recover the incomplete trajectory, current research mainly focuses on coarse-grained trajectory reconstruction. While these methods are adept at reconstructing the road segments traversed by vehicles, they cannot restore the spatial–temporal details of vehicle journeys and capture individual variability. To address these limitations, we propose a Multi-node Joint Optimization (MNJO) model, which utilizes AVI data and individual appearance features to achieve fine-grained vehicle trajectory reconstruction. The MNJO comprises two stages: local instance association and global trajectory reconstruction. In the local instance association stage, we design an inter-vehicle bidirectional optimization mechanism, which integrates the competitive and associative interactions among vehicles to improve their association across different nodes. In the global trajectory reconstruction stage, we propose a trajectory optimization network for trajectory scoring based on the spatial–temporal characteristics and the local association results of all nodes along the trajectory. Due to the lack of related datasets, we construct the Regional Vehicle Information (RVI) dataset, the first for fine-grained trajectory reconstruction, collected from real-world AVI systems. Extensive experiments on the RVI show that the MNJO can achieve significant enhancement in reconstruction accuracy compared to other methods, demonstrating the effectiveness and superiority of the proposed method. To the best of our knowledge, this is the first study on fine-grained vehicle trajectory reconstruction.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 104995"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hierarchical prediction uncertainty-aware motion planning for autonomous driving in lane-changing scenarios","authors":"Ruoyu Yao ,&nbsp;Xiaotong Sun","doi":"10.1016/j.trc.2024.104962","DOIUrl":"10.1016/j.trc.2024.104962","url":null,"abstract":"<div><div>Autonomous vehicles (AVs) are expected to achieve safe and efficient interactions with surrounding dynamic objects. Multi-lane driving scenarios, however, intensify the complexity of AV navigation, given the uncertainties associated with neighboring vehicles’ lane-changing intentions and the subsequent travel trajectories. Deep learning has demonstrated effectiveness in unraveling complex motion patterns, enabling stochastic predictions of intentions and trajectories. Nonetheless, reduced performance of deep-learning-based prediction may be observed in unseen driving environments owing to their “black-box” nature, potentially leading to incorrect decision-making in AV navigation in these environments. To address these challenges, this paper proposes a comprehensive AV planning framework that integrates hierarchical behavior prediction via deep learning with motion planning based on dynamic programming. A set of safety criteria is introduced within the motion planning module to accommodate hierarchical uncertainties in behavior patterns, adjustable based on the reliability of the prediction model and eschewing rigid distributional assumptions. An improved constrained iterative linear quadratic regulator is devised to handle the corresponding non-convex constraints and to offer efficient online solutions for AV navigation. Evaluations conducted with the INTERACTION and HighD datasets demonstrate the effectiveness of uncertainty-aware planning in enhancing AV safety performance.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 104962"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Adaptive inference for dynamic passenger route usage patterns in a metro network considering time-varying and heavy-tailed travel times","authors":"Zhuangbin Shi ,&nbsp;Wei Shen ,&nbsp;Paul Schonfeld ,&nbsp;Yang Liu ,&nbsp;Ning Zhang","doi":"10.1016/j.trc.2025.105007","DOIUrl":"10.1016/j.trc.2025.105007","url":null,"abstract":"<div><div>Due to the dynamic changes in timetables, passenger demand, and passenger composition, the distribution of passengers within a metro system becomes quite complex. Many studies divide a day into intervals to account for the dynamics of travel time. However, the intervals used in these studies are insufficient to capture the gradual and fine-grained changes in passenger travel patterns. This study proposes an adaptive dynamic route inference model (ADRIM) that overcomes these limitations. In the ADRIM, we introduce a constrained Expectation Maximization algorithm (CEM) by confining the parameters of the mixture log-normal distribution model (MLND) within confidence intervals, thereby reducing anomalous estimations. We use the concept of Hidden Markov Models (HMMs) to achieve a parameter-adaptive characterization for the dynamics of route choice and travel time distributions for MLND through an iterative process. For a Nanjing metro case study, the proposed model exhibits superior performance in fitting the actual distribution of travel times and accurately captures the dynamic trends in route travel times. Besides, it is revealed that the maximum difference in expected travel times among multiple valid routes for the same origin–destination (OD) pair primarily falls within the interval [5 min, 15 min], and the distribution range of the maximum ratio is mainly between [1.1, 1.6]. The high consistency in passenger route choice proportions observed for two consecutive weeks, along with an analysis of route choice patterns under dynamic conditions, serves as strong evidence supporting the reliability and practical utility of the dynamic route inference model in understanding and managing metro passenger flows.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 105007"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel game approach to integrating traffic assignment and signal control for enhanced efficiency and environmental performance in mixed networks","authors":"Hang Yang ,&nbsp;Wanjing Ma ,&nbsp;Rongjun Cheng ,&nbsp;Bing Wu ,&nbsp;Yibing Wang ,&nbsp;Pengjun Zheng","doi":"10.1016/j.trc.2025.105017","DOIUrl":"10.1016/j.trc.2025.105017","url":null,"abstract":"<div><div>The combined traffic assignment and signal control (CAC) has proven to be effective in enhancing the wholistic performance of mixed networks, which includes both expressways and surface streets. This study focuses on addressing the limitations of traditional Stackelberg game-based CAC models, particularly the rigid leader–follower dynamic. We propose an integrated Level-Change-MPC (Model Predictive Control)-VT-Meso-Emission Model (LCMVTM), which incorporates a dynamic role-change function triggered by the compliance rate of users to variable message signs (VMS). This role-change mechanism offers greater flexibility under varying road conditions and simplifies the authority’s task of predicting user routing behavior. Additionally, a Q-learning-based algorithm is developed to balance travel costs and emissions by managing the rate of emission accumulation across control horizons. The results demonstrate a reduction in total travel costs by 11% to over 30%, while emissions decrease by 16.98% to approximately 40% compared to the other different combination of control strategies and MAS/non MAS structured network. The emission accumulation rate also drops by 20% to 43.69%. LCMVTM outperformed the other benchmarks by reducing the number of stop&amp;go per vehicle, resulting in improved efficiency and environmental outcomes.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 105017"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Planning charging stations for mixed docked and dockless operations of shared electric micromobility systems","authors":"Yining Liu,&nbsp;Yanfeng Ouyang","doi":"10.1016/j.trc.2024.104989","DOIUrl":"10.1016/j.trc.2024.104989","url":null,"abstract":"<div><div>Dockless electric micro-mobility services (e.g., shared e-scooters and e-bikes) have been increasingly popular in the recent decade, and a variety of charging technologies have emerged for these services. The use of charging stations, to/from which service vehicles are transported by the riders for charging, poses as a promising approach because it reduces the need for dedicated staff or contractors. However, unique challenges also arise, as it introduces docked vehicles at these stations to the existing dockless systems, and now riders can pick up and drop off e-scooters at both random locations and fixed charging stations. This requires incentives for riders to drop off vehicles at the stations and management strategies to efficiently utilize the vehicles at the stations. This paper focuses on such mixed operations of docked and dockless e-scooters as an example. It develops a new aspatial queuing network model for vehicle sharing and charging to capture the steady-state e-scooter service cycles, battery consumption and charging processes, and the associated pricing and management mechanisms in a region with uniform demand. Building upon this model, a system of closed-form equations is formulated and incorporated into a constrained nonlinear program to optimize the deployment of the service fleet, the design of charging stations (i.e., number, location, and capacity), user-based charging price promotions and priorities, and repositioning truck operations (i.e., headway and truck load). The proposed queuing network model is found to match very well with agent-based simulations. It is applied to a series of numerical experiments to draw insights into the optimal designs and the system performance. The numerical results reveal strong advantages of using charging stations for shared dockless electric micro-mobility services as compared to state-of-the-art alternatives. The proposed model can also be used to analyze other micromobility services and other charging approaches.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 104989"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Robust trajectory optimization under arbitrary uncertainty using ensemble weather forecasting and statistical aircraft performance model","authors":"Yoshinori Matsuno,&nbsp;Haruki Matsuda","doi":"10.1016/j.trc.2025.104999","DOIUrl":"10.1016/j.trc.2025.104999","url":null,"abstract":"<div><div>Aircraft trajectory optimization can improve delay absorption and fuel efficiency; however, existing methods suffer from problems such as insufficient adaptability to uncertainty. This paper introduces a robust trajectory optimization algorithm for optimizing flight profiles in the presence of arbitrary uncertainties in weather forecasting and aircraft performance models. Ensemble forecast data are used to provide the uncertainty in the weather forecasts, and a statistical aircraft performance model based on flight data is utilized to provide the uncertainty in the aircraft performance model. Arbitrary polynomial chaos expansion is applied to efficiently quantify arbitrary uncertainties in aircraft dynamics, and incorporated into the trajectory optimization algorithm. The <span><math><mi>β</mi></math></span>-hill climbing algorithm, a stochastic local search algorithm developed recently, is employed to determine the optimal flight profiles. By conducting numerical simulations on a popular domestic flight route in Japan during time-based metering operations, this study assesses potential fuel savings by the optimal trajectories with speed control and step descent along the planned route, as opposed to radar vectoring. Actual flight data from past flights are utilized for evaluation, and average fuel savings of approximately 2% are expected. Based on the analysis conducted in this study, the effectiveness of the robust trajectory optimization algorithm and fuel savings for time-based metering operations are evaluated and demonstrated.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 104999"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Incorporating domain knowledge in deep neural networks for discrete choice models","authors":"Shadi Haj-Yahia,&nbsp;Omar Mansour,&nbsp;Tomer Toledo","doi":"10.1016/j.trc.2025.105014","DOIUrl":"10.1016/j.trc.2025.105014","url":null,"abstract":"<div><div>This paper explores the integration of domain knowledge into deep neural network (DNN) models to support the interpretability of travel demand predictions in the context of discrete choice models (DCMs). Traditional DCMs, formed as random utility models (RUM), are widely employed in travel demand analysis as a powerful theoretical econometric framework. But, they are often limited by subjective and simplified utility function specifications, which may not capture complex behaviors. This led to a growing interest in data-driven approaches. Due to their flexible architecture, DNNs offer a promising alternative for learning unobserved non-linear relationships in DCMs. But they are often criticized for their “black box” nature and potential deviations from established economic theory.</div><div>This paper proposes a framework that incorporates domain knowledge constraints into DNNs, guiding the models toward behaviorally realistic outcomes while retaining predictive flexibility. The framework’s effectiveness is demonstrated through a synthetic dataset and an empirical study using the Swissmetro dataset. The synthetic study confirms that domain knowledge constraints enhance consistency and economic plausibility, while the Swissmetro application shows that constrained models avoid implausible outcomes, such as negative values of time, and provide stable market share predictions. The proposed approach is independent of the model structure, making it applicable on different model architectures. The methodology was applied on both standard DNN and an alternative-specific utility DNN (ASU-DNN). Although constrained models exhibit a slight reduction in predictive fit, they generalize better to unseen data and produce interpretable results. This study offers a pathway for combining the flexibility of machine learning with domain expertise for DCMs, across diverse model architectures and datasets.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"171 ","pages":"Article 105014"},"PeriodicalIF":7.6,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}