Transportation Research Part E-Logistics and Transportation Review最新文献

{"title":"The role of dual purpose in retailer’s store brand introduction and quality strategies within a supply chain","authors":"Mingyou Meng ,&nbsp;Shiming Deng ,&nbsp;Pin Zhou ,&nbsp;He Xu","doi":"10.1016/j.tre.2024.103912","DOIUrl":"10.1016/j.tre.2024.103912","url":null,"abstract":"<div><div>To address stakeholders’ interests, firms increasingly adopt a dual-purpose agenda, typically involving the pursuit of profits and consumer surplus (CS). This study considers a supply chain dynamic involving a retailer and a national brand (NB) manufacturer, both potentially pursuing dual purposes, to investigate how their dual-purpose nature influences the introduction and quality strategies of the retailer’s store brand (SB). Our findings show that only the retailer pursuing CS has no impact on SB quality. However, if the NB manufacturer pursues CS, SB quality declines irrespective of the retailer’s stance. Interestingly, the for-profit retailer experiences reduced profits from SB introduction when also pursuing CS and expressing a high interest in it. Conversely, SB introduction enhances the dual-purpose manufacturer’s utility when its interest in CS is relatively high. The introduction of SB may lead to unintended price and payoff implications, with the manufacturer’s profit and the wholesale price exhibiting non-monotonic relationships with its interest in CS. Consequently, compared to the for-profit scenario, this may elevate the wholesale price, exacerbating the double marginalization effect. Additionally, when the retailer pursues CS, supply chain profit may increase because of the mitigated double marginalization effect, resulting from an unconventional reduction in retail markup rather than wholesale price. Our findings suggest that manufacturers pursuing CS could strategically alleviate profit losses stemming from retailers’ SB introduction. However, retailers should exercise caution when simultaneously introducing a SB and pursuing CS from a profitability standpoint.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103912"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142816526","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 of truck platooning for road-network capacitated vehicle routing problem","authors":"Yilang Hao ,&nbsp;Zhibin Chen ,&nbsp;Xiaotong Sun ,&nbsp;Lu Tong","doi":"10.1016/j.tre.2024.103898","DOIUrl":"10.1016/j.tre.2024.103898","url":null,"abstract":"<div><div>Truck platooning, a linking technology of trucks on the highway, has gained enormous attention in recent years due to its benefits in energy and operation cost savings. However, most existing studies on truck platooning limit their focus on particular scenarios that each truck can serve only one customer demand and is thus with a specified origin–destination pair, so only routing and time schedules are taken into account. Nevertheless, in real-world logistics, each truck may need to serve multiple customers located at different places, and the operator managing a fleet of trucks thus has to determine not only the routing and time schedules of each truck but also the set of customers allocated to each truck and their sequence to visit. This is well known as a capacitated vehicle routing problem with time windows (CVRPTW), and considering the application of truck platooning in such a problem entails new modeling frameworks and tailored solution algorithms. In light of this, this study makes the first attempt to optimize the truck platooning plan for a road-network CVRPTW in a way to minimize the total operation cost, including vehicles’ fixed dispatch cost and energy cost, while fulfilling all delivery demands within their time window constraints. Specifically, the operation plan will dictate the number of trucks to be dispatched, the set of customers, and the routing and time schedules for each truck. In addition, the modeling framework is constructed based on a road network instead of a traditional customer node graph to better resemble and facilitate the platooning operation. A 3-stage algorithm embedded with a ”route-then-schedule” scheme, Dynamic Programming, and Modified Insertion heuristic, is developed to solve the proposed model in a timely manner. Numerical experiments are conducted to validate the proposed modeling framework, demonstrate the performance of the proposed solution algorithm, and quantify the benefit brought by the truck platooning technology.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103898"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142816532","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":"Optimizing mixed traffic environments with shared and private autonomous vehicles: An equilibrium analysis of entrance permit and tradable credit strategies","authors":"Maryam Shaygan ,&nbsp;Fatemeh Banani Ardecani ,&nbsp;Mark Nejad","doi":"10.1016/j.tre.2024.103897","DOIUrl":"10.1016/j.tre.2024.103897","url":null,"abstract":"<div><div>The importance of relieving central business district (CBD) congestion while fulfilling network user demand in the morning daily commute has prompted much attention to shared mobility. The deployment of ridesharing paired with autonomous vehicles is expected to bring about a paradigm shift in traffic network dynamics by eliminating the considerable reliance on solo-passenger vehicle usage. In this study, we propose and evaluate two strategies: (1) a CBD entrance permit and (2) temporal capacity allocation with tradable credit. To evaluate the effectiveness of the proposed strategies, we consider four travel modes, including Transit (T), Shared Autonomous Vehicle (SAV), Autonomous Vehicle (AV), and Conventional Vehicle (CV), and account for various factors, such as costs associated with walking, autonomous vehicle self-driving, ridesharing, travel time, and schedule delay. These strategies aim to encourage commuters to adopt sustainable transit or shared mobility options, taking into account different scenarios that consider the challenges and advantages of ridesharing alongside traditional transit systems. The findings indicate that implementing temporal capacity allocation for ridesharing with tradable credit is more advantageous compared to the CBD entrance permit, particularly when the disparity in the fixed additional cost of using SAVs and AVs is minimal. However, both strategies rely on accurately estimating the extra cost incurred by commuters when opting for ridesharing services. Besides, introducing tradable award schemes for ridesharing and transit can improve the efficiency of the system. This study highlights the importance of using new methods and strategies in regulating the travel behavior of commuters with the emergence of autonomous vehicles and shared mobility options to determine solutions for optimizing the system cost. The findings of this study provide valuable insights for transportation planners and policymakers to develop effective strategies for reducing traffic congestion in CBDs.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103897"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142867654","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":"Retrieval request sequencing in a novel tier-captive AVS/RS with a double-capacity lift","authors":"Jingjing Yang ,&nbsp;Xiaolong Guo ,&nbsp;Ran Chen ,&nbsp;Zhaotong Wang","doi":"10.1016/j.tre.2024.103955","DOIUrl":"10.1016/j.tre.2024.103955","url":null,"abstract":"<div><div>We study an innovative autonomous vehicle storage and retrieval system equipped with a double-capacity lift (AVS/RS-DL), where the lift is capable of transporting two unit loads simultaneously. Therefore, given a set of retrieval requests, the retrieval sequencing problem consists of deciding which requests are paired together in the same tour and determining the sequence in which the requests are processed to minimize the makespan. The problem is proved to be NP-hard. We propose a two-step decomposition algorithm that first employs a greedy heuristic to identify pairs of retrieval requests. Subsequently, a dynamic programming approach, complemented by a rollout heuristic, is utilized to determine the sequence of these pairs. Comparative numerical experiments demonstrate that the algorithm leads to substantial makespan reduction compared to the methods proposed in the literature. Furthermore, we examine the benefits of the double-capacity lift against single-capacity alternatives and separate lifting tables that can operate in parallel but not pass each other. Real-world data analysis showcases the superiority of our proposed algorithm over the commonly employed first-come-first-served policy. Finally, we demonstrate that our algorithm can easily be extended to accommodate varying buffer sizes, a multi-capacity lift, and to simultaneously sequence both retrieval and storage requests.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103955"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142939699","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":"Quantifying variable contributions to bus operation delays considering causal relationships","authors":"Qi Zhang ,&nbsp;Zhenliang Ma ,&nbsp;Yuanyuan Wu ,&nbsp;Yang Liu ,&nbsp;Xiaobo Qu","doi":"10.1016/j.tre.2024.103881","DOIUrl":"10.1016/j.tre.2024.103881","url":null,"abstract":"<div><div>Bus services often face operational delays due to dynamic conditions such as traffic congestion, which can propagate through bus routes, affecting overall system performance. Understanding the causes of bus arrival delays is crucial for effective public transport management and control. Moreover, understanding the contribution of each factor to bus delays not only aids in developing targeted strategies to mitigate delays but is also crucial for effective decision-making and planning. Traditional research primarily focuses on correlation-based analysis, lacking the ability to reveal the underlying causal mechanisms. Additionally, no studies have considered the complex causal relationships between factors when quantifying their contributions to outcomes in public transport. This study aims to analyze the factors causing bus arrival delays from a causal perspective, focusing on quantifying the causal contribution of each factor while considering their causal relationships. Quantifying a factor’s causal contribution poses challenges due to computational complexity and statistical bias from the limited sample size. Using a causal discovery method, this study generates a causal graph for bus arrival delays and employs the causality-based Shapley value to quantify the contribution of each variable. The study further uses the Double Machine Learning (DML) approach to estimate the causal contributions, which provides a consistent and computationally feasible method. A case study was conducted using Google Transit Feed Specification (GTFS) data, focusing on high-frequency bus routes in Stockholm, Sweden. To validate the model, cross-validation was performed by comparing variable importance rankings with traditional models, including Linear Regression (LR) and Structural Equation Modeling (SEM). The comparison shows that results from the causality-based Shapley value significantly differ from those obtained by traditional methods in terms of importance rankings and influence magnitudes. The findings underscore the significant impact of origin delays on bus punctuality, a factor often underestimated in previous studies. Additionally, it demonstrates that employing a causal discovery model can not only infer causal relationships but also reveal direct and indirect effects, which can provide more intuitive explanations. Finally, although the causal results are mathematically and intuitively sound, it is important to further investigate the real causality impact in practice using lab experiments or A/B tests in real-world settings.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103881"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142788855","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":"Designing hub-based regional transportation networks with service level constraints","authors":"Esteban Ogazón ,&nbsp;Ana María Anaya-Arenas ,&nbsp;Angel Ruiz","doi":"10.1016/j.tre.2025.103991","DOIUrl":"10.1016/j.tre.2025.103991","url":null,"abstract":"<div><div>This paper investigates the suitability of hub-based structures for coping with so-called regional transportation networks, i.e., transportation structures able to connect any two nodes in the network respecting a tight service level requirement. While hub-and-spoke structures have been extensively studied in the literature, they were typically approached as strategic problems with minimal focus on incorporating service-related constraints. This contrasts with current trends in regional transportation that request greater flexibility and stricter service schedules. We analyze how the requirement of time-definite constraints impacts three different hub-based network topologies, including a new structure proposing a double-path route to connect the inter-hubs traffic. To this end, we extend previous formulations to cope with the mentioned time-definite constraints, and we propose a new set-packing formulation for the one that connects the hubs by a double-path route. Numerical experiments based on realistic instances inspired by Quebec’s Integrated Centers of Healthcare and Social Services (CISSS) allowed us to evaluate the performance of the proposed configurations, demonstrating the critical importance of selecting the appropriate hub network structure to meet targeted service levels. We provide valuable insights for managers aiming to redesign their regional transportation networks with an emphasis on service level and synchronization.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"195 ","pages":"Article 103991"},"PeriodicalIF":8.3,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143072512","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":"PTB: A deep reinforcement learning method for flexible logistics service combination problem with spatial-temporal constraint","authors":"Ran Tian,&nbsp;Longlong Chang,&nbsp;Zhihui Sun,&nbsp;Guanglu Zhao,&nbsp;Xin Lu","doi":"10.1016/j.tre.2025.103978","DOIUrl":"10.1016/j.tre.2025.103978","url":null,"abstract":"<div><div>The Fourth Party Logistics Service platform aims to provide customers with one-stop logistics services by combining logistics services from different logistics service providers. However, it is an important challenge to quickly build the logistics service combination with the maximum overall profit under the premise of satisfying spatial–temporal constraints. The traditional heuristic algorithm has the problem of low computing efficiency and insufficient adaptability to dynamic environment and demand uncertainty when dealing with the problem of large-scale logistics service combination with spatial–temporal constraints and uncertainty of service. Therefore, we propose the Proximal policy optimization algorithm integrating the Transformer network and the Bayesian networks (PTB). Firstly, a variable length sequence module based on the greedy strategy is used in the environment to generate the status information of the order, to solve the problem that the traditional reinforcement learning environment cannot handle any number of service providers. Then, a policy network integrating the Transformer and Bayes network is used to further optimize the accuracy and reliability of scheduling decisions. Meanwhile the PPO algorithm is used to update the network and constantly optimize the scheduling decisions of agents. Finally, the experimental results on four sets of logistics order scenes show that PTB can effectively solve the logistics service combination problem with spatial–temporal constraints, and the results of most logistics service combination tasks are better than other baseline models, and in large-scale order scenes, it has far more computational efficiency than the traditional heuristic algorithm, and shows good generalization ability.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"195 ","pages":"Article 103978"},"PeriodicalIF":8.3,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143072514","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":"Enhancing carsharing pricing and operations through integrated choice models","authors":"Beatriz Brito Oliveira ,&nbsp;Selin Damla Ahipasaoglu","doi":"10.1016/j.tre.2025.103993","DOIUrl":"10.1016/j.tre.2025.103993","url":null,"abstract":"<div><div>Balancing supply and demand in free-floating one-way carsharing systems is a critical operational challenge. This paper presents a novel approach that integrates a binary logit model into a mixed integer linear programming framework to optimize short-term pricing and fleet relocation. Demand modeling, based on a binary logit model, aggregates different trips under a unified utility model and improves estimation by incorporating information from similar trips. To speed up the estimation process, a categorizing approach is used, where variables such as location and time are classified into a few categories based on shared attributes. This is particularly beneficial for trips with limited observations as information gained from similar trips can be used for these trips effectively. The modeling framework adopts a dynamic structure where the binary logit model estimates demand using accumulated observations from past iterations at each decision point. This continuous learning environment allows for dynamic improvement in estimation and decision-making. At the core of the framework is a mathematical program that prescribes optimal levels of promotion and relocation. The framework then includes simulated market responses to the decisions, allowing for real-time adjustments to effectively balance supply and demand. Computational experiments demonstrate the effectiveness of the proposed approach and highlight its potential for real-world applications. The continuous learning environment, combining demand modeling and operational decisions, opens avenues for future research in transportation systems.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"195 ","pages":"Article 103993"},"PeriodicalIF":8.3,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143072513","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":"Should live streaming be adopted for agricultural supply chain considering platform’s quality improvement and blockchain support?","authors":"Xiaoping Xu ,&nbsp;Xinru Chen ,&nbsp;Jinyan Hou ,&nbsp;T.C.E. Cheng ,&nbsp;Yugang Yu ,&nbsp;Li Zhou","doi":"10.1016/j.tre.2024.103950","DOIUrl":"10.1016/j.tre.2024.103950","url":null,"abstract":"<div><div>Platforms empower farmers to address the quality and safety issues of agricultural products by offering blockchain technology and improving product quality. Recently, live streaming becomes a new sales channel to sell products, and plays a key role in enhancing the visibility of agricultural products and introducing detailed information of agricultural products in real time. This disrupted the long-term cooperative relationship between the platforms and farmers. Based on this, our paper explores that whether and how the agricultural supply chain members should adopt the live streaming channel. We build a game model that consists of a farmer, a platform, and an influencer, and investigate the live streaming introduction strategies in the agricultural supply chain in the context of the platform assisting the farmer (the improvement of quality level and adoption of blockchain). We capture two characteristics of the live streaming channel, i.e., the live streaming channel’s impact on market size (live streaming value) and additional profit per unit product derived from the influencer’s personal influence (influencer value). We interestingly find that when the live streaming value is low, introducing live streaming negatively impacts the farmer’s profit at the low influencer value in the farmer’s live streaming. When the live streaming value is low (high), introducing live streaming damages the platform’s profit at the moderate (low) influencer value in the platform’s live streaming. Therefore, adopting the live streaming channel is not necessarily profitable for agricultural supply chain members. We also extend our model to check the robustness of our findings. This study is the first to explore live streaming introduction strategies in the agricultural supply chain in the context of the platform assisting the farmer, and significantly contributes to the literature and provides valuable guidance for farmers and platforms on when to adopt the live streaming channel in the agricultural supply chain.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"195 ","pages":"Article 103950"},"PeriodicalIF":8.3,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143072515","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":"Returns management in a supply chain considering freight insurance and consumer disappointment aversion","authors":"Yueqing Bian,&nbsp;Tiaojun Xiao","doi":"10.1016/j.tre.2025.103975","DOIUrl":"10.1016/j.tre.2025.103975","url":null,"abstract":"<div><div>Returns tend to cut profit and leave consumers unhappy, making returns management a critical issue in supply chain operations. This paper investigates the role of consumer disappointment aversion, stemming from product value uncertainty, in shaping critical operational decisions in a return-focused supply chain, including the pricing policy, the manufacturer’s returns collection strategy (direct returns from consumers or indirect buybacks from the e-tailer), and the e-tailer’s return freight insurance strategy (e-tailer-return freight insurance or consumer-return freight insurance). Through a game-theoretical approach, we reveal several compelling insights. First, as consumer disappointment aversion rises, both the manufacturer and the e-tailer are compelled to lower prices to maintain demand, despite an overall decline in profitability. Second, regarding the impacts of consumer disappointment aversion on the supply chain equilibrium, two pivotal findings are uncovered. For the e-tailer, high consumer disappointment aversion motivates the e-tailer-return freight insurance strategy. Furthermore, how consumer disappointment aversion shapes the manufacturer’s returns collection strategy is strongly linked to the e-tailer’s choice of return freight insurance strategy. Specifically, in certain cases, in anticipation of the e-tailer’s adoption of e-tailer-return freight insurance strategy, the manufacturer is incentivized to prefer direct returns when consumer disappointment aversion is relatively low. However, the manufacturer is incentivized to select direct returns when facing a relatively high consumer disappointment aversion, anticipating the e-tailer’s adoption of consumer-return freight insurance strategy. Moreover, our analysis indicates that each equilibrium has the potential to achieve Pareto efficiency and even a win–win–win outcome that benefits all parties including consumers.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"195 ","pages":"Article 103975"},"PeriodicalIF":8.3,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143072516","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}