首页 > 最新文献

Journal of Rail Transport Planning & Management最新文献

英文 中文
The evaluation of competition effect on rail fares using the difference-in-difference method through symmetric and lagged spans 通过对称和滞后跨度使用差分法评估竞争对铁路票价的影响
IF 2.6 Q3 TRANSPORTATION Pub Date : 2024-12-01 Epub Date: 2024-10-15 DOI: 10.1016/j.jrtpm.2024.100484
Evgeniia Shtele , Paolo Beria , Samuel Tolentino
Long-distance railway markets in Europe have become more competitive since the EU liberalisation packages. Countries like Austria, Czechia, Sweden, and Italy have experienced sustained competition, providing valuable insights into how open-access competition works. Italy's non-subsidised high-speed competition is especially interesting to study. While some researchers have studied the minimum price changes before and after a newcomer enters a route, more is needed about the duration of the effect and the impact on all fare types. Our paper estimates the competition's impact by observing the price dynamics of the incumbent company (Trenitalia) for different fare types over an extended period. We examine the Turin-Milan-Venice route where the competitor (Italo) entered the market during observation. We distinguish between different fare types through detailed descriptive analyses of the incumbent company's price behaviour. Using the difference-in-difference method, we obtain estimates of the effect for different time spans and check their robustness.
Two methods are used to design difference-in-difference models: a “classical approach” that compares symmetrical intervals before and after entry and another approach based on the comparison of lagged intervals. The second method compares the specific span with the corresponding one, a year before to exclude the seasonal component. Our findings reveal significant price-reduction effects compared to the price dynamics in other market routes where competition had been introduced.
自欧盟实施一揽子自由化计划以来,欧洲长途铁路市场的竞争日趋激烈。奥地利、捷克、瑞典和意大利等国经历了持续的竞争,为了解开放式竞争如何发挥作用提供了宝贵的见解。意大利的无补贴高速竞争尤其值得研究。虽然一些研究人员已经研究了新加入者进入某条线路前后的最低价格变化,但还需要更多关于这种影响的持续时间以及对所有票价类型的影响的研究。我们的论文通过观察现有公司(意大利铁路公司)在一段较长时期内不同票价类型的价格动态来估算竞争的影响。我们研究了都灵-米兰-威尼斯线路,在观察期间,竞争者(意大利铁路公司)进入了该线路市场。我们通过对现有公司的价格行为进行详细的描述性分析来区分不同的票价类型。我们采用两种方法设计差分模型:一种是比较进入市场前后对称区间的 "经典方法",另一种是基于比较滞后区间的方法。第二种方法将特定时间跨度与一年前的相应时间跨度进行比较,以排除季节性因素。我们的研究结果表明,与其他引入竞争的市场路线的价格动态相比,价格下降效果显著。
{"title":"The evaluation of competition effect on rail fares using the difference-in-difference method through symmetric and lagged spans","authors":"Evgeniia Shtele ,&nbsp;Paolo Beria ,&nbsp;Samuel Tolentino","doi":"10.1016/j.jrtpm.2024.100484","DOIUrl":"10.1016/j.jrtpm.2024.100484","url":null,"abstract":"<div><div>Long-distance railway markets in Europe have become more competitive since the EU liberalisation packages. Countries like Austria, Czechia, Sweden, and Italy have experienced sustained competition, providing valuable insights into how open-access competition works. Italy's non-subsidised high-speed competition is especially interesting to study. While some researchers have studied the minimum price changes before and after a newcomer enters a route, more is needed about the duration of the effect and the impact on all fare types. Our paper estimates the competition's impact by observing the price dynamics of the incumbent company (Trenitalia) for different fare types over an extended period. We examine the Turin-Milan-Venice route where the competitor (Italo) entered the market during observation. We distinguish between different fare types through detailed descriptive analyses of the incumbent company's price behaviour. Using the difference-in-difference method, we obtain estimates of the effect for different time spans and check their robustness.</div><div>Two methods are used to design difference-in-difference models: a “classical approach” that compares symmetrical intervals before and after entry and another approach based on the comparison of lagged intervals. The second method compares the specific span with the corresponding one, a year before to exclude the seasonal component. Our findings reveal significant price-reduction effects compared to the price dynamics in other market routes where competition had been introduced.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100484"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142433557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation 危险品运输中铁路阻塞问题的双目标模型和分支-价格-切割求解方法
IF 2.6 Q3 TRANSPORTATION Pub Date : 2024-12-01 Epub Date: 2024-10-29 DOI: 10.1016/j.jrtpm.2024.100486
Masoud Yaghini , Hosna Pooladi , Mohammad Karimi
One of the most important railway transportation problems is the railroad blocking problem (RBP). To our knowledge, no works consider the costs and risks of hazmat transportation in the RBP literature. In this paper, a bi-objective mathematical model is proposed for the RBP considering the risk of hazmat transportation and operating costs. The objective functions are (1) minimizing the cost of delivering commodities while observing limits on the number and aggregate volume of the blocks assembled at each terminal in freight railroads, and (2) minimizing the risk of hazmat transportation in terminals and en route. The ε-constraint method and a presented branch-and-price-and-cut (B&P&C) algorithm are used to solve the proposed bi-objective model. To evaluate the model and the solution method, seventeen experimental instances based on real-world conditions are generated and solved. Modeling and solving the experimental instances and the case study revealed the proposed model's capability and the solution method's efficiency. In addition, as a case study, the proposed model and algorithm are implemented in the Iranian railway network.
最重要的铁路运输问题之一是铁路阻塞问题(RBP)。据我们所知,在 RBP 文献中还没有考虑危险品运输成本和风险的著作。本文提出了一个考虑危险品运输风险和运营成本的 RBP 双目标数学模型。目标函数为:(1) 在遵守货运铁路各终点站集装区块的数量和总体积限制的同时,最大限度地降低商品交付成本;(2) 最大限度地降低终点站和运输途中的危险品运输风险。本文采用ε约束法和分支-价格-切割(B&P&C)算法来求解所提出的双目标模型。为了评估该模型和求解方法,生成并求解了 17 个基于真实世界条件的实验实例。实验实例的建模和求解以及案例研究揭示了所提模型的能力和求解方法的效率。此外,作为案例研究,还在伊朗铁路网络中实施了所提出的模型和算法。
{"title":"A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation","authors":"Masoud Yaghini ,&nbsp;Hosna Pooladi ,&nbsp;Mohammad Karimi","doi":"10.1016/j.jrtpm.2024.100486","DOIUrl":"10.1016/j.jrtpm.2024.100486","url":null,"abstract":"<div><div>One of the most important railway transportation problems is the railroad blocking problem (RBP). To our knowledge, no works consider the costs and risks of hazmat transportation in the RBP literature. In this paper, a bi-objective mathematical model is proposed for the RBP considering the risk of hazmat transportation and operating costs. The objective functions are (1) minimizing the cost of delivering commodities while observing limits on the number and aggregate volume of the blocks assembled at each terminal in freight railroads, and (2) minimizing the risk of hazmat transportation in terminals and en route. The ε-constraint method and a presented branch-and-price-and-cut (B&amp;P&amp;C) algorithm are used to solve the proposed bi-objective model. To evaluate the model and the solution method, seventeen experimental instances based on real-world conditions are generated and solved. Modeling and solving the experimental instances and the case study revealed the proposed model's capability and the solution method's efficiency. In addition, as a case study, the proposed model and algorithm are implemented in the Iranian railway network.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100486"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142538772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A reinforcement learning approach to solving very-short term train rescheduling problem for a single-track rail corridor 解决单轨铁路走廊极短期列车重新调度问题的强化学习方法
IF 2.6 Q3 TRANSPORTATION Pub Date : 2024-12-01 Epub Date: 2024-09-25 DOI: 10.1016/j.jrtpm.2024.100483
Jin Liu, Zhiyuan Lin, Ronghui Liu
Railway operations are regularly affected by incidents such as disturbances and disruptions, which cause temporary operational restrictions to the trains in the network. Compared to real-time disturbances and disruptions, sometimes these incidents can be known at a short notice, e.g., 24–48 h beforehand, which is known as the Very-Short-Term-Planning in British rail operations. This paper presents a novel reinforcement learning based approach for rescheduling train services for in a single-track corridor with bi-directional traffic. As an important subfield of machine learning, reinforcement learning offers an alternate strategy for tackling the NP-hard train (re)scheduling problems and shows its advantages in balancing computational efficiency and solution quality. We propose a Q-learning approach with a tiered rewarding strategy and lightweight train representation in state vectors, which enables more efficient learning and knowledge sharing among homogeneous trains. Compared with an existing reinforcement learning approach, our proposed method can find better quality solutions due to its unique representation of state vectors and a novel tiered rewarding/punishing mechanism, overcoming certain disadvantages in existing approaches. Knowledge reusability is another advantage of the proposed approach, as prior knowledge obtained from training one instance can significantly enhance the performance of another, potentially more challenging, instance on the same corridor with substantially reduced computational time and effort on algorithm development. We also discuss the potential applications of the knowledge reusability feature inherent in reinforcement learning algorithms, which we believe will benefit the entire industry in addressing NP-hard problems through data-driven technologies.
铁路运营经常会受到干扰和中断等事故的影响,这些事故会对铁路网中的列车造成临时运营限制。与实时干扰和中断相比,这些事故有时可以在很短时间内(如 24-48 小时前)被知晓,这在英国铁路运营中被称为 "短期规划"(Very-Short-Term-Planning)。本文提出了一种基于强化学习的新方法,用于在双向交通的单轨走廊中重新安排列车服务。作为机器学习的一个重要子领域,强化学习为解决 NP 难度的列车(重新)调度问题提供了另一种策略,并显示了其在平衡计算效率和解决方案质量方面的优势。我们提出了一种 Q-learning 方法,该方法采用分层奖励策略和轻量级的状态向量列车表示法,能在同质列车之间实现更高效的学习和知识共享。与现有的强化学习方法相比,我们提出的方法因其独特的状态向量表示法和新颖的分层奖励/惩罚机制,可以找到更高质量的解决方案,克服了现有方法的某些缺点。知识的可重用性是所提方法的另一个优势,因为从一个实例的训练中获得的先验知识可以显著提高同一走廊上另一个可能更具挑战性的实例的性能,同时大幅减少算法开发的计算时间和工作量。我们还讨论了强化学习算法固有的知识可重用性特点的潜在应用,相信这将有利于整个行业通过数据驱动技术解决 NP 难问题。
{"title":"A reinforcement learning approach to solving very-short term train rescheduling problem for a single-track rail corridor","authors":"Jin Liu,&nbsp;Zhiyuan Lin,&nbsp;Ronghui Liu","doi":"10.1016/j.jrtpm.2024.100483","DOIUrl":"10.1016/j.jrtpm.2024.100483","url":null,"abstract":"<div><div>Railway operations are regularly affected by incidents such as disturbances and disruptions, which cause temporary operational restrictions to the trains in the network. Compared to real-time disturbances and disruptions, sometimes these incidents can be known at a short notice, e.g., 24–48 h beforehand, which is known as the Very-Short-Term-Planning in British rail operations. This paper presents a novel reinforcement learning based approach for rescheduling train services for in a single-track corridor with bi-directional traffic. As an important subfield of machine learning, reinforcement learning offers an alternate strategy for tackling the NP-hard train (re)scheduling problems and shows its advantages in balancing computational efficiency and solution quality. We propose a Q-learning approach with a tiered rewarding strategy and lightweight train representation in state vectors, which enables more efficient learning and knowledge sharing among homogeneous trains. Compared with an existing reinforcement learning approach, our proposed method can find better quality solutions due to its unique representation of state vectors and a novel tiered rewarding/punishing mechanism, overcoming certain disadvantages in existing approaches. Knowledge reusability is another advantage of the proposed approach, as prior knowledge obtained from training one instance can significantly enhance the performance of another, potentially more challenging, instance on the same corridor with substantially reduced computational time and effort on algorithm development. We also discuss the potential applications of the knowledge reusability feature inherent in reinforcement learning algorithms, which we believe will benefit the entire industry in addressing NP-hard problems through data-driven technologies.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100483"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142319384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Relationships between service quality and customer satisfaction in rail freight transportation: A structural equation modeling approach 铁路货运服务质量与客户满意度之间的关系:结构方程建模方法
IF 2.6 Q3 TRANSPORTATION Pub Date : 2024-12-01 Epub Date: 2024-10-21 DOI: 10.1016/j.jrtpm.2024.100485
Md Sabbir Hossain Muni , Md Moshiur Rahman Khan , Niaz Mahmud Zafri , Mohammed Mojahid Hossain Chowdhury
Promoting the use of rail for freight transportation can improve logistics performance and contribute to sustainable development. To increase the share of rail freight, it is crucial to understand its service quality factors as well as their relationships with customer satisfaction, which have not been studied yet. Therefore, the objective of this study was twofold: first, to construct a reliable service quality measurement instrument for understanding the service quality factors and their associated indicators; and second, to examine the direct and indirect relationships between these service quality factors and customer satisfaction. A questionnaire survey was conducted among shippers, freight forwarders, and clearance and forwarding agents (C&F) in Bangladesh, resulting in the collection of 209 samples. Analyzing the data through exploratory factor analysis (EFA) and confirmatory factor analysis (CFA), we developed a six-dimensional instrument for service quality measurement, which includes tangibility, cost of transportation, transit time, reliability, safety and security, and responsiveness. The empirical results obtained through structural equation modeling (SEM) indicated that tangibility has the highest impact on customer satisfaction, followed by cost of transportation. Additionally, transit time, reliability, and responsiveness also play significant roles in influencing customer satisfaction. The findings of the research would help the rail authorities improve the service quality of rail freight transportation and, consequently, enhance customer satisfaction levels.
推广使用铁路货运可以提高物流绩效,促进可持续发展。要提高铁路货运的份额,关键是要了解其服务质量因素及其与客户满意度之间的关系,而目前尚未对这些因素进行研究。因此,本研究的目标有两个:第一,构建可靠的服务质量测量工具,以了解服务质量因素及其相关指标;第二,研究这些服务质量因素与客户满意度之间的直接和间接关系。对孟加拉国的托运人、货运代理、清关和货运代理(C&F)进行了问卷调查,共收集到 209 个样本。通过探索性因子分析(EFA)和确认性因子分析(CFA)对数据进行分析,我们开发了一个六维度的服务质量测量工具,包括有形性、运输成本、运输时间、可靠性、安全保障和响应性。结构方程模型(SEM)得出的实证结果表明,有形性对客户满意度的影响最大,其次是运输成本。此外,运输时间、可靠性和响应速度对客户满意度的影响也很大。研究结果将有助于铁路部门改善铁路货运的服务质量,从而提高客户满意度。
{"title":"Relationships between service quality and customer satisfaction in rail freight transportation: A structural equation modeling approach","authors":"Md Sabbir Hossain Muni ,&nbsp;Md Moshiur Rahman Khan ,&nbsp;Niaz Mahmud Zafri ,&nbsp;Mohammed Mojahid Hossain Chowdhury","doi":"10.1016/j.jrtpm.2024.100485","DOIUrl":"10.1016/j.jrtpm.2024.100485","url":null,"abstract":"<div><div>Promoting the use of rail for freight transportation can improve logistics performance and contribute to sustainable development. To increase the share of rail freight, it is crucial to understand its service quality factors as well as their relationships with customer satisfaction, which have not been studied yet. Therefore, the objective of this study was twofold: first, to construct a reliable service quality measurement instrument for understanding the service quality factors and their associated indicators; and second, to examine the direct and indirect relationships between these service quality factors and customer satisfaction. A questionnaire survey was conducted among shippers, freight forwarders, and clearance and forwarding agents (C&amp;F) in Bangladesh, resulting in the collection of 209 samples. Analyzing the data through exploratory factor analysis (EFA) and confirmatory factor analysis (CFA), we developed a six-dimensional instrument for service quality measurement, which includes tangibility, cost of transportation, transit time, reliability, safety and security, and responsiveness. The empirical results obtained through structural equation modeling (SEM) indicated that tangibility has the highest impact on customer satisfaction, followed by cost of transportation. Additionally, transit time, reliability, and responsiveness also play significant roles in influencing customer satisfaction. The findings of the research would help the rail authorities improve the service quality of rail freight transportation and, consequently, enhance customer satisfaction levels.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100485"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142528486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Shippers/freight forwarders’ acceptance of dedicated rail freight corridors for freight mobility in India 托运人/货运代理对印度货运专用铁路走廊的接受程度
IF 2.6 Q3 TRANSPORTATION Pub Date : 2024-12-01 Epub Date: 2024-09-14 DOI: 10.1016/j.jrtpm.2024.100481
Sowjanya Dhulipala , Gopal R. Patil

This paper investigates the acceptance of a mega rail freight infrastructure as a sustainable alternative to road transport for domestic freight movements in India. The dedicated rail freight corridors (DFCs) are the freight-only rail corridors proposed by the Indian government to improve freight mobility from a sustainable outlook. A shipper/freight forwarder survey was conducted to gather information on mode attributes and their stated preferences toward DFCs. We employ discrete choice (binary logit) and machine learning algorithms (random forest and extreme gradient boosting) to analyse the choice behaviour. The machine learning methods exhibited higher prediction accuracy, while discrete choice models offered better interpretability. On-time performance and transport costs are crucial factors that influence mode choice. Large-scale companies are more willing to shift to DFCs compared to small and medium firms. The policy scenario analysis indicates that providing a better on-time performance can gain a substantial share of DFCs.

本文研究了在印度国内货运中将超大型铁路货运基础设施作为公路运输可持续替代方案的接受程度。专用铁路货运走廊(DFC)是印度政府提出的货运专用铁路走廊,旨在从可持续发展的角度改善货运流动性。我们对托运人/货运代理进行了调查,以收集有关模式属性及其对 DFCs 偏好的信息。我们采用离散选择(二元 logit)和机器学习算法(随机森林和极端梯度提升)来分析选择行为。机器学习方法的预测准确率更高,而离散选择模型的可解释性更好。准时率和运输成本是影响模式选择的关键因素。与中小型企业相比,大型企业更愿意转向 DFC。政策情景分析表明,提供更好的准点率可以获得大量的双向燃料电池份额。
{"title":"Shippers/freight forwarders’ acceptance of dedicated rail freight corridors for freight mobility in India","authors":"Sowjanya Dhulipala ,&nbsp;Gopal R. Patil","doi":"10.1016/j.jrtpm.2024.100481","DOIUrl":"10.1016/j.jrtpm.2024.100481","url":null,"abstract":"<div><p>This paper investigates the acceptance of a mega rail freight infrastructure as a sustainable alternative to road transport for domestic freight movements in India. The dedicated rail freight corridors (DFCs) are the freight-only rail corridors proposed by the Indian government to improve freight mobility from a sustainable outlook. A shipper/freight forwarder survey was conducted to gather information on mode attributes and their stated preferences toward DFCs. We employ discrete choice (binary logit) and machine learning algorithms (random forest and extreme gradient boosting) to analyse the choice behaviour. The machine learning methods exhibited higher prediction accuracy, while discrete choice models offered better interpretability. On-time performance and transport costs are crucial factors that influence mode choice. Large-scale companies are more willing to shift to DFCs compared to small and medium firms. The policy scenario analysis indicates that providing a better on-time performance can gain a substantial share of DFCs.</p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100481"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142229043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A decomposition approach to solve the individual railway crew Re-planning problem 解决铁路机组人员重新规划问题的分解方法
IF 2.6 Q3 TRANSPORTATION Pub Date : 2024-12-01 Epub Date: 2024-11-10 DOI: 10.1016/j.jrtpm.2024.100487
Ying Wang , Xiaoyong He , Thomas Breugem , Dennis Huisman
Crew re-planning is an important and difficult task in railway crew management. In this paper, we establish a path-based model solving the Individual Crew Re-planning Problem (ICRP). The individual indicates that we focus the problem on specific (non-anonymous) crew members, considering their roles (leader and cabin crew) and qualifications. This problem is inspired by the crew planning problem faced in Chinese high-speed railway operations. To generate feasible paths, we construct a multi-layer time-space connection network and develop a heuristic algorithm. To decrease the complexity and scale of the model, we decompose the ICRP into two sub-problems (for leaders and for cabin crew members respectively) which can be solved in sequence. In addition, we develop a Lagrangian relaxation (LR) algorithm to get valid paths quickly for both sub-problems. We combine the LR algorithm with solving the restricted decomposed models to get a good quality solution for the studied ICRP problem. We test our methods on several real-world instances from Chinese high-speed railways. The computational experiments show that our LR algorithm with a decomposition strategy can solve the decomposed models in a relatively short computation time compared to solving the original model directly, while obtaining (near-)optimal solutions for all instances.
乘务员重新规划是铁路乘务员管理中一项重要而艰巨的任务。在本文中,我们建立了一个基于路径的模型来解决乘务员个人重新规划问题(Individual Crew Re-planning Problem,简称 ICRP)。个体表示我们将问题集中在特定(非匿名)的乘务员身上,同时考虑到他们的角色(领队和乘务员)和资质。这个问题的灵感来源于中国高速铁路运营中面临的乘务员规划问题。为了生成可行路径,我们构建了一个多层时空连接网络,并开发了一种启发式算法。为了降低模型的复杂性和规模,我们将 ICRP 分解为两个子问题(分别针对领导和乘务员),并依次求解。此外,我们还开发了一种拉格朗日松弛(Lagrangian relaxation,LR)算法,以快速获得两个子问题的有效路径。我们将拉格朗日算法与受限分解模型的求解结合起来,从而为所研究的 ICRP 问题找到了高质量的解决方案。我们在中国高速铁路的几个实际案例中测试了我们的方法。计算实验表明,与直接求解原始模型相比,我们采用分解策略的 LR 算法能在相对较短的计算时间内求解分解模型,同时获得所有实例的(接近)最优解。
{"title":"A decomposition approach to solve the individual railway crew Re-planning problem","authors":"Ying Wang ,&nbsp;Xiaoyong He ,&nbsp;Thomas Breugem ,&nbsp;Dennis Huisman","doi":"10.1016/j.jrtpm.2024.100487","DOIUrl":"10.1016/j.jrtpm.2024.100487","url":null,"abstract":"<div><div>Crew re-planning is an important and difficult task in railway crew management. In this paper, we establish a path-based model solving the Individual Crew Re-planning Problem (ICRP). The individual indicates that we focus the problem on specific (non-anonymous) crew members, considering their roles (leader and cabin crew) and qualifications. This problem is inspired by the crew planning problem faced in Chinese high-speed railway operations. To generate feasible paths, we construct a multi-layer time-space connection network and develop a heuristic algorithm. To decrease the complexity and scale of the model, we decompose the ICRP into two sub-problems (for leaders and for cabin crew members respectively) which can be solved in sequence. In addition, we develop a Lagrangian relaxation (LR) algorithm to get valid paths quickly for both sub-problems. We combine the LR algorithm with solving the restricted decomposed models to get a good quality solution for the studied ICRP problem. We test our methods on several real-world instances from Chinese high-speed railways. The computational experiments show that our LR algorithm with a decomposition strategy can solve the decomposed models in a relatively short computation time compared to solving the original model directly, while obtaining (near-)optimal solutions for all instances.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100487"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142659440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A MILP model to improve the robustness of a railway timetable by retiming and rerouting in a complex bottleneck area 在复杂瓶颈区域通过重新计时和重新安排路线提高铁路时刻表稳健性的 MILP 模型
IF 2.6 Q3 TRANSPORTATION Pub Date : 2024-12-01 Epub Date: 2024-11-16 DOI: 10.1016/j.jrtpm.2024.100488
Inneke Van Hoeck, Pieter Vansteenwegen
Robustness is a crucial concept in railway timetabling. It is often related to the ability of a timetable to absorb small delays. We propose a MILP model to improve the robustness of an existing microscopic timetable in a complex and heavily used part of the network. The objective is to maximise the buffer times between each pair of trains, leading to a good spreading in time of the trains. Focusing on this objective will lead to less propagation of delays and therefore shorter and more reliable travel times for the passengers. The model can adapt both the timing and the routing of the trains. However, to ensure that the proposed timetable is practically relevant for the railway companies, constraints can be added easily depending on the properties that the resulting timetable should have. Due to the flexibility of the proposed model, it can also be used to analyse and optimise alternative scenarios. The model is applied to a case study of a bottleneck area of the Belgian railway network, located just outside of Brussels, where the traffic is very heterogeneous. The results show that the spreading objective can be improved with 18% compared to the current situation.
稳健性是铁路时刻表编制中的一个重要概念。它通常与时刻表吸收小延误的能力有关。我们提出了一个 MILP 模型,以提高现有微观时刻表的稳健性,该时刻表位于铁路网的一个复杂且使用频繁的区域。我们的目标是使每对列车之间的缓冲时间最大化,从而使列车的时间分布更加合理。专注于这一目标将减少延误的传播,从而缩短乘客的旅行时间并提高其可靠性。该模型可以调整列车的时间和路线。然而,为了确保所建议的时刻表对铁路公司具有实际意义,可以根据所生成的时刻表应具有的属性轻松添加限制条件。由于拟议模型的灵活性,它还可用于分析和优化其他方案。该模型应用于比利时铁路网瓶颈区域的案例研究,该区域位于布鲁塞尔外围,交通流量非常分散。结果表明,与目前的情况相比,扩展目标可提高 18%。
{"title":"A MILP model to improve the robustness of a railway timetable by retiming and rerouting in a complex bottleneck area","authors":"Inneke Van Hoeck,&nbsp;Pieter Vansteenwegen","doi":"10.1016/j.jrtpm.2024.100488","DOIUrl":"10.1016/j.jrtpm.2024.100488","url":null,"abstract":"<div><div>Robustness is a crucial concept in railway timetabling. It is often related to the ability of a timetable to absorb small delays. We propose a MILP model to improve the robustness of an existing microscopic timetable in a complex and heavily used part of the network. The objective is to maximise the buffer times between each pair of trains, leading to a good spreading in time of the trains. Focusing on this objective will lead to less propagation of delays and therefore shorter and more reliable travel times for the passengers. The model can adapt both the timing and the routing of the trains. However, to ensure that the proposed timetable is practically relevant for the railway companies, constraints can be added easily depending on the properties that the resulting timetable should have. Due to the flexibility of the proposed model, it can also be used to analyse and optimise alternative scenarios. The model is applied to a case study of a bottleneck area of the Belgian railway network, located just outside of Brussels, where the traffic is very heterogeneous. The results show that the spreading objective can be improved with 18% compared to the current situation.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100488"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142659441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exploring the relationship between the determinants and the ridership decrease of urban rail transit station during the COVID-19 pandemic incorporating spatial heterogeneity 结合空间异质性,探讨 COVID-19 大流行期间城市轨道交通车站乘客量减少的决定因素与乘客量减少之间的关系
IF 2.6 Q3 TRANSPORTATION Pub Date : 2024-12-01 Epub Date: 2024-09-14 DOI: 10.1016/j.jrtpm.2024.100482
Junfang Li , Haixiao Pan , Weiwei Liu , Yingxue Chen

The study explores the relationship between the determinants and the ridership decrease incorporating spatial heterogeneity. ARIMA model is utilized to estimate the normal ridership assumed absence of COVID-19. Geography weighted regression (GWR) with Gaussian kernel function is constructed for regression. The K-means algorithm is applied to cluster the stations based on coefficients. Stations of Tokyo case are clustered into 2 groups: city area and western ward which represents mainly suburban areas. City stations are mainly influenced by the number of transfer lines, distance to the CBD, number of jobs and residents. In the western ward, the level of importance that residents place on public health primarily influences the ridership decrease. The implementation of work-from-home policies makes number of jobs a positive impactor on the decrease in ridership, with a greater impact observed on urban stations compared to suburban stations. City residents tend to engage in more travel than suburban residents because of less spacious living environments, which partially offsets the decrease in ridership. The findings offer parameters for predicting ridership of both city and suburban stations during public health emergency events, such as COVID-19. They can assist URT operators in developing strategies for balancing passenger demand and operational costs.

本研究探讨了决定因素与乘客量减少之间的关系,并纳入了空间异质性。利用 ARIMA 模型来估计假定不存在 COVID-19 的正常乘客量。利用高斯核函数构建地理加权回归(GWR)进行回归。应用 K-means 算法根据系数对车站进行聚类。东京案例中的站点分为两组:城区和主要代表郊区的西区。市区车站主要受换乘线路数量、与中央商务区的距离、工作岗位和居民数量的影响。在西区,居民对公共卫生的重视程度主要影响乘客量的下降。居家办公政策的实施使工作岗位数量成为乘客量减少的一个积极影响因素,与郊区车站相比,市区车站受到的影响更大。由于居住环境不宽敞,城市居民往往比郊区居民出行更多,这部分抵消了乘客减少的影响。研究结果为预测 COVID-19 等公共卫生突发事件期间城市和郊区车站的乘客人数提供了参数。它们可以帮助城市轨道交通运营商制定平衡乘客需求和运营成本的策略。
{"title":"Exploring the relationship between the determinants and the ridership decrease of urban rail transit station during the COVID-19 pandemic incorporating spatial heterogeneity","authors":"Junfang Li ,&nbsp;Haixiao Pan ,&nbsp;Weiwei Liu ,&nbsp;Yingxue Chen","doi":"10.1016/j.jrtpm.2024.100482","DOIUrl":"10.1016/j.jrtpm.2024.100482","url":null,"abstract":"<div><p>The study explores the relationship between the determinants and the ridership decrease incorporating spatial heterogeneity. ARIMA model is utilized to estimate the normal ridership assumed absence of COVID-19. Geography weighted regression (GWR) with Gaussian kernel function is constructed for regression. The K-means algorithm is applied to cluster the stations based on coefficients. Stations of Tokyo case are clustered into 2 groups: city area and western ward which represents mainly suburban areas. City stations are mainly influenced by the number of transfer lines, distance to the CBD, number of jobs and residents. In the western ward, the level of importance that residents place on public health primarily influences the ridership decrease. The implementation of work-from-home policies makes number of jobs a positive impactor on the decrease in ridership, with a greater impact observed on urban stations compared to suburban stations. City residents tend to engage in more travel than suburban residents because of less spacious living environments, which partially offsets the decrease in ridership. The findings offer parameters for predicting ridership of both city and suburban stations during public health emergency events, such as COVID-19. They can assist URT operators in developing strategies for balancing passenger demand and operational costs.</p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"32 ","pages":"Article 100482"},"PeriodicalIF":2.6,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142232874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep reinforcement learning with predictive auxiliary task for autonomous train collision avoidance 带预测性辅助任务的深度强化学习用于自动列车防撞
IF 3.7 Q3 TRANSPORTATION Pub Date : 2024-09-01 Epub Date: 2024-06-10 DOI: 10.1016/j.jrtpm.2024.100453
Antoine Plissonneau , Luca Jourdan , Damien Trentesaux , Lotfi Abdi , Mohamed Sallak , Abdelghani Bekrar , Benjamin Quost , Walter Schön

The contribution of this paper consists of a deep reinforcement learning (DRL) based method for autonomous train collision avoidance. While DRL applied to autonomous vehicles’ collision avoidance has shown interesting results compared to traditional methods, train-like vehicles are not currently covered. In addition, DRL applied to collision avoidance suffers from sparse rewards, which can lead to poor convergence and long training time. To overcome these limitations, this paper proposes a method for training a reinforcement learning (RL) agent for collision avoidance using local obstacle information mapped into occupancy grids. This method also integrates a network architecture containing a predictive auxiliary task consisting in future state prediction and encouraging the intermediate representation to be predictive of obstacle trajectories. A comparison study conducted on multiple simulated scenarios demonstrates that the trained policy outperforms other deep-learning-based policies as well as human driving in terms of both safety and efficiency. As a first step toward the certification of a DRL based method, this paper proposes to approximate the policy learned by the RL agent with an interpretable decision tree. Although this approximation results in a loss of performance, it enables a safety analysis of the learned function and thus paves the way to use the strengths of RL in certifiable algorithms. As this work is pioneering the use of RL for collision avoidance of rail-guided vehicles, and to facilitate future work by other engineers and researchers, a RL-ready simulator is provided with this paper.

本文的贡献在于提出了一种基于深度强化学习(DRL)的自动列车防撞方法。与传统方法相比,将 DRL 应用于自动驾驶汽车的防撞已经取得了令人感兴趣的结果,但目前还没有涉及类似火车的车辆。此外,应用于防撞的 DRL 还存在奖励稀疏的问题,这可能导致收敛性差和训练时间长。为了克服这些局限性,本文提出了一种利用映射到占位网格中的局部障碍物信息来训练避撞强化学习(RL)代理的方法。该方法还整合了一个网络架构,其中包含一个预测性辅助任务,包括未来状态预测,并鼓励中间表征对障碍物轨迹进行预测。在多个模拟场景中进行的对比研究表明,经过训练的策略在安全性和效率方面都优于其他基于深度学习的策略以及人类驾驶。作为基于 DRL 方法认证的第一步,本文建议用可解释的决策树来近似 RL 代理学习到的策略。虽然这种近似会导致性能损失,但却能对所学功能进行安全分析,从而为在可认证算法中利用 RL 的优势铺平道路。由于这项工作是将 RL 用于轨道制导车辆防撞的先驱,为方便其他工程师和研究人员今后开展工作,本文提供了一个 RL 就绪模拟器。
{"title":"Deep reinforcement learning with predictive auxiliary task for autonomous train collision avoidance","authors":"Antoine Plissonneau ,&nbsp;Luca Jourdan ,&nbsp;Damien Trentesaux ,&nbsp;Lotfi Abdi ,&nbsp;Mohamed Sallak ,&nbsp;Abdelghani Bekrar ,&nbsp;Benjamin Quost ,&nbsp;Walter Schön","doi":"10.1016/j.jrtpm.2024.100453","DOIUrl":"https://doi.org/10.1016/j.jrtpm.2024.100453","url":null,"abstract":"<div><p>The contribution of this paper consists of a deep reinforcement learning (DRL) based method for autonomous train collision avoidance. While DRL applied to autonomous vehicles’ collision avoidance has shown interesting results compared to traditional methods, train-like vehicles are not currently covered. In addition, DRL applied to collision avoidance suffers from sparse rewards, which can lead to poor convergence and long training time. To overcome these limitations, this paper proposes a method for training a reinforcement learning (RL) agent for collision avoidance using local obstacle information mapped into occupancy grids. This method also integrates a network architecture containing a predictive auxiliary task consisting in future state prediction and encouraging the intermediate representation to be predictive of obstacle trajectories. A comparison study conducted on multiple simulated scenarios demonstrates that the trained policy outperforms other deep-learning-based policies as well as human driving in terms of both safety and efficiency. As a first step toward the certification of a DRL based method, this paper proposes to approximate the policy learned by the RL agent with an interpretable decision tree. Although this approximation results in a loss of performance, it enables a safety analysis of the learned function and thus paves the way to use the strengths of RL in certifiable algorithms. As this work is pioneering the use of RL for collision avoidance of rail-guided vehicles, and to facilitate future work by other engineers and researchers, a RL-ready simulator is provided with this paper.</p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"31 ","pages":"Article 100453"},"PeriodicalIF":3.7,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141303993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Trajectory optimization for heavy-haul trains considering cyclic braking under complex operating conditions 复杂运行条件下考虑循环制动的重载列车轨迹优化
IF 2.6 Q3 TRANSPORTATION Pub Date : 2024-09-01 Epub Date: 2024-07-25 DOI: 10.1016/j.jrtpm.2024.100462
Min Zhou , Yuesong Liu , Hongwei Wang , Hairong Dong

Heavy-haul railways (HHRs) pose significant challenges due to their substantial traction weight, extended train length, and complex operational environments. Heavy-haul trains (HHTs), equipped with traditional pneumatic control braking systems, must adopt cycle braking strategies on long downhill slopes. The varying traction masses of HHTs on these railways lead to diverse maneuvering characteristics, presenting challenges for drivers and dispatchers in unforeseen circumstances. To enhance transportation efficiency and mitigate operational complexities, a trajectory optimization method is formulated for determining the optimal trajectory of HHTs with different traction masses under complex conditions, including long downhill slopes, temporary speed limit sections, and regular sections. It considers the dynamics of train traction, braking, and coasting at each phase, optimizing objectives such as train operation efficiency, energy consumption, and pneumatic braking times. A linear weight search algorithm ensures punctuality, and the model is linearized into a mixed-integer linear programming (MILP) form using segmented and stepwise functions to align with operational realities. Simulation experiments utilizing real data and various HHT configurations validate the efficacy of the proposed approach against alternative methods. This method offers precise trajectory optimization under complex conditions, providing valuable guidance for dispatchers and drivers in the heavy-haul railway sector.

重载铁路(HHR)因其牵引重量大、列车长度长和运行环境复杂而面临巨大挑战。配备传统气动控制制动系统的重载列车(HHT)必须在长下坡时采用循环制动策略。在这些铁路上,重载列车的牵引质量各不相同,导致操纵特性也各不相同,在不可预见的情况下给驾驶员和调度员带来了挑战。为了提高运输效率并降低运营复杂性,本文提出了一种轨迹优化方法,用于确定不同牵引质量的高速列车在长下坡、临时限速路段和常规路段等复杂条件下的最优轨迹。它考虑了列车在每个阶段的牵引、制动和滑行动态,优化了列车运行效率、能耗和气动制动时间等目标。线性权重搜索算法可确保正点率,模型线性化为混合整数线性规划(MILP)形式,使用分段函数和逐步函数,以符合运行实际情况。利用真实数据和各种 HHT 配置进行的模拟实验验证了所提方法与其他方法相比的有效性。该方法可在复杂条件下提供精确的轨迹优化,为铁路重载运输部门的调度员和司机提供有价值的指导。
{"title":"Trajectory optimization for heavy-haul trains considering cyclic braking under complex operating conditions","authors":"Min Zhou ,&nbsp;Yuesong Liu ,&nbsp;Hongwei Wang ,&nbsp;Hairong Dong","doi":"10.1016/j.jrtpm.2024.100462","DOIUrl":"10.1016/j.jrtpm.2024.100462","url":null,"abstract":"<div><p>Heavy-haul railways (HHRs) pose significant challenges due to their substantial traction weight, extended train length, and complex operational environments. Heavy-haul trains (HHTs), equipped with traditional pneumatic control braking systems, must adopt cycle braking strategies on long downhill slopes. The varying traction masses of HHTs on these railways lead to diverse maneuvering characteristics, presenting challenges for drivers and dispatchers in unforeseen circumstances. To enhance transportation efficiency and mitigate operational complexities, a trajectory optimization method is formulated for determining the optimal trajectory of HHTs with different traction masses under complex conditions, including long downhill slopes, temporary speed limit sections, and regular sections. It considers the dynamics of train traction, braking, and coasting at each phase, optimizing objectives such as train operation efficiency, energy consumption, and pneumatic braking times. A linear weight search algorithm ensures punctuality, and the model is linearized into a mixed-integer linear programming (MILP) form using segmented and stepwise functions to align with operational realities. Simulation experiments utilizing real data and various HHT configurations validate the efficacy of the proposed approach against alternative methods. This method offers precise trajectory optimization under complex conditions, providing valuable guidance for dispatchers and drivers in the heavy-haul railway sector.</p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"31 ","pages":"Article 100462"},"PeriodicalIF":2.6,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141960789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Rail Transport Planning & Management
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1