首页 > 最新文献

Transportation Research Part B-Methodological最新文献

英文 中文
CV-MP: Max-pressure control in heterogeneously distributed and partially connected vehicle environments CV-MP:非均匀分布和部分连接车辆环境中的最大压力控制
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-03 DOI: 10.1016/j.trb.2025.103387
Chaopeng Tan , Dingshan Sun , Hao Liu , Marco Rinaldi , Hans van Lint
Max-pressure (MP) control has emerged as a prominent real-time network traffic signal control strategy due to its simplicity, decentralized structure, and theoretical guarantees of network queue stability. Meanwhile, advances in connected vehicle (CV) technology have sparked extensive research into CV-based traffic signal control. Despite these developments, few studies have investigated MP control in heterogeneously distributed and partially CV environments while ensuring network queue stability. To address these research gaps, we propose a CV-based MP control (CV-MP) method that leverages real-time CV travel time information to compute the pressure, thereby incorporating both the spatial distribution and temporal delays of vehicles, unlike existing approaches that utilized only spatial distribution or temporal delays. In particular, we establish sufficient conditions for road network queue stability that are compatible with most existing MP control methods. Moreover, we pioneered the proof of network queue stability even if the vehicles are only partially connected and heterogeneously distributed, and gave a necessary condition of CV observation for maintaining the stability. Evaluation results on an Amsterdam corridor show that CV-MP significantly reduces vehicle delays compared to both actuated control and conventional MP control across various CV penetration rates. Moreover, in scenarios with dynamic traffic demand, CV-MP achieves lower spillover peaks even with low and heterogeneous CV penetration rates, further highlighting its effectiveness and robustness.
最大压力(MP)控制以其简单、分散的结构和理论上保证网络队列稳定性的优点,成为一种重要的实时网络交通信号控制策略。与此同时,车联网技术的进步引发了对基于车联网的交通信号控制的广泛研究。尽管取得了这些进展,但很少有研究在保证网络队列稳定性的同时,对异构分布和部分CV环境中的MP控制进行研究。为了解决这些研究空白,我们提出了一种基于CV的MP控制(CV-MP)方法,该方法利用实时CV行驶时间信息来计算压力,从而结合车辆的空间分布和时间延迟,而不是仅利用空间分布或时间延迟的现有方法。特别是,我们建立了与大多数现有MP控制方法兼容的路网队列稳定的充分条件。此外,我们还首次证明了车辆仅部分连接和异构分布情况下的网络队列稳定性,并给出了保持稳定性的CV观察的必要条件。阿姆斯特丹走廊的评估结果表明,在不同的CV渗透率下,与驱动控制和传统MP控制相比,CV-MP显著减少了车辆延误。此外,在流量需求动态的场景下,CV- mp即使在低渗透率和异质性渗透率的情况下也能达到较低的溢出峰值,进一步凸显了其有效性和鲁棒性。
{"title":"CV-MP: Max-pressure control in heterogeneously distributed and partially connected vehicle environments","authors":"Chaopeng Tan ,&nbsp;Dingshan Sun ,&nbsp;Hao Liu ,&nbsp;Marco Rinaldi ,&nbsp;Hans van Lint","doi":"10.1016/j.trb.2025.103387","DOIUrl":"10.1016/j.trb.2025.103387","url":null,"abstract":"<div><div>Max-pressure (MP) control has emerged as a prominent real-time network traffic signal control strategy due to its simplicity, decentralized structure, and theoretical guarantees of network queue stability. Meanwhile, advances in connected vehicle (CV) technology have sparked extensive research into CV-based traffic signal control. Despite these developments, few studies have investigated MP control in heterogeneously distributed and partially CV environments while ensuring network queue stability. To address these research gaps, we propose a CV-based MP control (CV-MP) method that leverages real-time CV travel time information to compute the pressure, thereby incorporating both the spatial distribution and temporal delays of vehicles, unlike existing approaches that utilized only spatial distribution or temporal delays. In particular, we establish sufficient conditions for road network queue stability that are compatible with most existing MP control methods. Moreover, we pioneered the proof of network queue stability even if the vehicles are only partially connected and heterogeneously distributed, and gave a necessary condition of CV observation for maintaining the stability. Evaluation results on an Amsterdam corridor show that CV-MP significantly reduces vehicle delays compared to both actuated control and conventional MP control across various CV penetration rates. Moreover, in scenarios with dynamic traffic demand, CV-MP achieves lower spillover peaks even with low and heterogeneous CV penetration rates, further highlighting its effectiveness and robustness.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103387"},"PeriodicalIF":6.3,"publicationDate":"2026-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145883574","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}
引用次数: 0
Corrigendum to “Beyond Box-Cox: A diffusion-inspired functional framework for nonlinear demand and discrete choice modeling” [Transportation Research Part B: Methodological, Volume 192 (2026) 103380 pp. 1-24] “超越Box-Cox:非线性需求和离散选择建模的扩散启发功能框架”的勘误表[运输研究B部分:方法论,卷192(2026)103380页1-24]
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-31 DOI: 10.1016/j.trb.2025.103385
Jeppe Rich
{"title":"Corrigendum to “Beyond Box-Cox: A diffusion-inspired functional framework for nonlinear demand and discrete choice modeling” [Transportation Research Part B: Methodological, Volume 192 (2026) 103380 pp. 1-24]","authors":"Jeppe Rich","doi":"10.1016/j.trb.2025.103385","DOIUrl":"10.1016/j.trb.2025.103385","url":null,"abstract":"","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103385"},"PeriodicalIF":6.3,"publicationDate":"2025-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145895480","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}
引用次数: 0
Modeling multilane traffic flow in Lagrangian coordinates: Formulation and implementation 拉格朗日坐标下的多车道交通流建模:制定与实现
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-26 DOI: 10.1016/j.trb.2025.103384
Liang Lu , Fangfang Zheng , Xiaobo Liu , Henry X. Liu , Yufei Yuan
This paper proposes a multilane traffic flow model based on the notions of conservation laws in Lagrangian coordinates. Both continuous formulation and discretization of the model are derived explicitly considering lane-changing characteristics. For model discretization, a lane-changing number estimation model is developed to calculate the net lane-changing number for each vehicle group considering the relative position between vehicle groups in the current and adjacent lanes. With model discretization, the spacing of vehicle groups for each lane can be dynamically calculated. In addition, the boundary conditions for both the continuous Lagrangian model and its discretization are also derived. A numerical implementation of the model in the case of a three-lane highway section with a lane-drop is discussed, and results indicate that the proposed Lagrangian model can well simulate traffic dynamics, including the generation and propagation of congestion, and the perturbation caused by lane-changing behaviors. The lane-changing characteristics in terms of a cumulative net number of lane-changing vehicles for each lane, and the spacing dynamics of vehicle groups can be estimated as well. We further validate the proposed model using real-world data observed from a two-lane freeway section in Japan. The results show that the proposed multilane Lagrangian model can well capture traffic dynamic properties and could provide a relatively accurate estimation in terms of lane volume dynamics, vehicle spacing dynamics, and the cumulative net number of lane-changing vehicles. Comparisons with the Eulerian multilane model indicate that the Lagrangian model offers superior performance in predicting vehicle counts and spacing, especially under congested conditions. This improved performance can be attributed to the Lagrangian model’s capability to track individual vehicle groups, resulting in a more precise representation of traffic dynamics.
基于拉格朗日坐标系下守恒定律的概念,提出了一种多车道交通流模型。在考虑变道特性的情况下,导出了模型的连续化和离散化。在模型离散化方面,建立了变道数估计模型,考虑车辆组在当前车道和相邻车道上的相对位置,计算出每组车辆的净变道数。通过模型离散化,可以动态计算出各车道的车辆组间距。此外,还导出了连续拉格朗日模型及其离散化的边界条件。讨论了该模型的数值实现,结果表明,拉格朗日模型可以很好地模拟交通动力学,包括拥堵的产生和传播,以及变道行为引起的扰动。以每条车道累计变道车辆净数量为单位的变道特性,以及车辆组间距动态。我们使用从日本双车道高速公路路段观察到的真实数据进一步验证了所提出的模型。结果表明,所提出的多车道拉格朗日模型能较好地捕捉交通动态特性,并能较准确地估计车道体积动态、车辆间距动态和变道车辆累计净数量。与欧拉多车道模型的比较表明,拉格朗日模型在预测车辆数量和间距方面具有更好的性能,特别是在拥挤条件下。这种改进的性能可归因于拉格朗日模型跟踪单个车辆组的能力,从而更精确地表示交通动态。
{"title":"Modeling multilane traffic flow in Lagrangian coordinates: Formulation and implementation","authors":"Liang Lu ,&nbsp;Fangfang Zheng ,&nbsp;Xiaobo Liu ,&nbsp;Henry X. Liu ,&nbsp;Yufei Yuan","doi":"10.1016/j.trb.2025.103384","DOIUrl":"10.1016/j.trb.2025.103384","url":null,"abstract":"<div><div>This paper proposes a multilane traffic flow model based on the notions of conservation laws in Lagrangian coordinates. Both continuous formulation and discretization of the model are derived explicitly considering lane-changing characteristics. For model discretization, a lane-changing number estimation model is developed to calculate the net lane-changing number for each vehicle group considering the relative position between vehicle groups in the current and adjacent lanes. With model discretization, the spacing of vehicle groups for each lane can be dynamically calculated. In addition, the boundary conditions for both the continuous Lagrangian model and its discretization are also derived. A numerical implementation of the model in the case of a three-lane highway section with a lane-drop is discussed, and results indicate that the proposed Lagrangian model can well simulate traffic dynamics, including the generation and propagation of congestion, and the perturbation caused by lane-changing behaviors. The lane-changing characteristics in terms of a cumulative net number of lane-changing vehicles for each lane, and the spacing dynamics of vehicle groups can be estimated as well. We further validate the proposed model using real-world data observed from a two-lane freeway section in Japan. The results show that the proposed multilane Lagrangian model can well capture traffic dynamic properties and could provide a relatively accurate estimation in terms of lane volume dynamics, vehicle spacing dynamics, and the cumulative net number of lane-changing vehicles. Comparisons with the Eulerian multilane model indicate that the Lagrangian model offers superior performance in predicting vehicle counts and spacing, especially under congested conditions. This improved performance can be attributed to the Lagrangian model’s capability to track individual vehicle groups, resulting in a more precise representation of traffic dynamics.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103384"},"PeriodicalIF":6.3,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145845510","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}
引用次数: 0
Is waiting worth it? the value of delaying time window assignment in vehicle routing problems 等待值得吗?车辆路径问题中延迟时间窗分配的价值
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-24 DOI: 10.1016/j.trb.2025.103381
Sifa Çelik , Albert H. Schrotenboer , Layla Martin , Tom Van Woensel
We explore the critical balance between immediate and delayed communication of time windows to customers in next-day business services, e.g., repairs, high-value deliveries, or installments. Faster communication benefits customers but potentially harms routing quality, including on-time delivery and transport costs. This paper addresses the Dynamic Delayed Time Window Assignment Vehicle Routing Problem (DDTWAVRP), a complex decision-making challenge service providers face. We model the DDTWAVRP as a semi-Markov Decision Process (MDP) with a finite time horizon. We propose two online algorithms as a solution methodology to evaluate the value of delay, namely, the rollout and the multiple scenario approach policy. Rollout policy simulates and approximates the value function to create robust solutions, whereas the multiple scenario approach policy searches for the most popular solution amongst sampled scenarios. We compare the performance of the proposed methodologies with other benchmark policies from the literature. Our numerical study shows an 11.82 % decrease in routing durations if we allow delaying a time window assignment. Compared to only assigning time windows once all demand is known, routing costs only increase marginally. We show that the decision to delay a time window assignment depends on the current state and must be tailored to customers.
我们探索在第二天的商业服务中,如维修、高价值交付或分期付款,与客户的即时和延迟时间窗口之间的关键平衡。更快的通信对客户有利,但可能会损害路由质量,包括准时交付和运输成本。本文研究了服务提供商面临的复杂决策挑战——动态延迟时间窗分配车辆路径问题(DDTWAVRP)。我们将DDTWAVRP建模为有限时间范围的半马尔可夫决策过程(MDP)。我们提出了两种在线算法作为评估延迟价值的解决方法,即rollout和多场景方法策略。Rollout策略模拟和近似值函数以创建健壮的解决方案,而多场景方法策略在抽样场景中搜索最流行的解决方案。我们将提出的方法的性能与文献中的其他基准策略进行比较。我们的数值研究表明,如果我们允许延迟时间窗口分配,路由持续时间减少11.82%。与只在所有需求都已知时才分配时间窗口相比,路由成本只会略微增加。我们表明延迟时间窗口分配的决定取决于当前状态,并且必须针对客户进行调整。
{"title":"Is waiting worth it? the value of delaying time window assignment in vehicle routing problems","authors":"Sifa Çelik ,&nbsp;Albert H. Schrotenboer ,&nbsp;Layla Martin ,&nbsp;Tom Van Woensel","doi":"10.1016/j.trb.2025.103381","DOIUrl":"10.1016/j.trb.2025.103381","url":null,"abstract":"<div><div>We explore the critical balance between immediate and delayed communication of time windows to customers in next-day business services, e.g., repairs, high-value deliveries, or installments. Faster communication benefits customers but potentially harms routing quality, including on-time delivery and transport costs. This paper addresses the Dynamic Delayed Time Window Assignment Vehicle Routing Problem (DDTWAVRP), a complex decision-making challenge service providers face. We model the DDTWAVRP as a semi-Markov Decision Process (MDP) with a finite time horizon. We propose two online algorithms as a solution methodology to evaluate the value of delay, namely, the rollout and the multiple scenario approach policy. Rollout policy simulates and approximates the value function to create robust solutions, whereas the multiple scenario approach policy searches for the most popular solution amongst sampled scenarios. We compare the performance of the proposed methodologies with other benchmark policies from the literature. Our numerical study shows an 11.82 % decrease in routing durations if we allow delaying a time window assignment. Compared to only assigning time windows once all demand is known, routing costs only increase marginally. We show that the decision to delay a time window assignment depends on the current state and must be tailored to customers.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103381"},"PeriodicalIF":6.3,"publicationDate":"2025-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145823194","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}
引用次数: 0
Using nudging information to manage congestion and emissions in a road and metro network 使用轻推信息来管理道路和地铁网络的拥堵和排放
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-23 DOI: 10.1016/j.trb.2025.103382
Zhiyuan Liang , Vincent A.C. van den Berg , Erik T. Verhoef , Yacan Wang
This paper studies nudging information and how it can alter commuter behaviour through awareness of the health and environmental impacts of their choices. We investigate how effective and beneficial nudging can be, depending on, amongst other things, how people respond to the nudging. We develop a bi-modal road and metro network model that includes bottleneck road congestion and crowding in the metro. We include health costs and environmental externalities. When commuters are homogeneous, nudging generates positive welfare effects, except under extremely high crowding effects. Moreover, nudging can consistently complement flat road tolls. By adding variations in environmental preferences, car types, and income, the study further highlights that the effectiveness of such strategies depends on heterogeneity in behavioural responses and preferences. Nudging is more likely to lower welfare when causing welfare-reducing swaps in drivers’ departure patterns; and, in such cases, it does not complement flat tolling. Our results reveal that although nudging may be analytically similar to pricing, it operates through non-monetary behavioural incentives and thus has distinctly different, and sometimes adverse, welfare outcomes.
这篇论文研究了轻推信息,以及它如何通过意识到他们的选择对健康和环境的影响来改变通勤者的行为。我们研究轻推的有效性和有益程度,这取决于人们对轻推的反应。我们开发了一个包含瓶颈道路拥堵和地铁拥挤的双模式道路和地铁网络模型。我们将健康成本和环境外部性考虑在内。当通勤者是同质的,除了在拥挤程度极高的情况下,轻推会产生积极的福利效应。此外,“轻推”政策可以持续补充公路收费。通过增加环境偏好、汽车类型和收入的变化,该研究进一步强调了这些策略的有效性取决于行为反应和偏好的异质性。当在司机离开模式中造成福利减少的互换时,轻推更有可能降低福利;而且,在这种情况下,它不能补充收费。我们的研究结果表明,尽管轻推在分析上可能与定价相似,但它是通过非货币行为激励来运作的,因此具有明显不同的,有时甚至是不利的福利结果。
{"title":"Using nudging information to manage congestion and emissions in a road and metro network","authors":"Zhiyuan Liang ,&nbsp;Vincent A.C. van den Berg ,&nbsp;Erik T. Verhoef ,&nbsp;Yacan Wang","doi":"10.1016/j.trb.2025.103382","DOIUrl":"10.1016/j.trb.2025.103382","url":null,"abstract":"<div><div>This paper studies nudging information and how it can alter commuter behaviour through awareness of the health and environmental impacts of their choices. We investigate how effective and beneficial nudging can be, depending on, amongst other things, how people respond to the nudging. We develop a bi-modal road and metro network model that includes bottleneck road congestion and crowding in the metro. We include health costs and environmental externalities. When commuters are homogeneous, nudging generates positive welfare effects, except under extremely high crowding effects. Moreover, nudging can consistently complement flat road tolls. By adding variations in environmental preferences, car types, and income, the study further highlights that the effectiveness of such strategies depends on heterogeneity in behavioural responses and preferences. Nudging is more likely to lower welfare when causing welfare-reducing swaps in drivers’ departure patterns; and, in such cases, it does not complement flat tolling. Our results reveal that although nudging may be analytically similar to pricing, it operates through non-monetary behavioural incentives and thus has distinctly different, and sometimes adverse, welfare outcomes.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103382"},"PeriodicalIF":6.3,"publicationDate":"2025-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145823201","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}
引用次数: 0
Beyond Box-Cox: A diffusion-inspired functional framework for nonlinear demand and discrete choice modeling 超越Box-Cox:非线性需求和离散选择建模的扩散启发功能框架
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-19 DOI: 10.1016/j.trb.2025.103380
Jeppe Rich
This paper presents a new diffusion-inspired functional framework for modeling nonlinear demand and discrete choice, with applications in transportation and related fields. The framework goes beyond traditional transformations by combining a diffusion-like core function with upper and lower bound functions, linked through a transfer function. Key properties such as monotonicity and concavity or convexity are guaranteed by simple, verifiable conditions on the component functions. A key advantage of this approach is that it breaks the nonlinear structure into separate parts, making it easier to integrate socio-economic variables. This enables the model to capture non-linear shifts, damping, and scaling effects across different socio-economic groups. The framework is low-parametric, bounded, continuous, and modular, which makes it easy to estimate using standard software. Its flexibility and strengths are illustrated in two case studies: (i) a discrete choice model of transport mode selection, and (ii) a nonlinear logistic regression model of vehicle ownership. In both cases, the framework enhances model fit, facilitates better control over tail behavior, demonstrates how heterogeneity can be effectively integrated, and yields more precise and behaviorally plausible elasticity estimates. Controlled simulations further demonstrate the framework’s robustness across a broad range of nonlinear processes. Adjusting the individual sub-components leads to distinct functional behaviors, preventing convergence toward a single common shape. This diversity indicates that the framework avoids ”copy-cat” behavior or functional collapse. As a result, its flexible, bounded structure can be tailored or relaxed depending on the application, offering virtually limitless possibilities for adapting functions to address different problems.
本文提出了一种新的用于非线性需求和离散选择建模的扩散启发函数框架,并应用于交通运输等相关领域。该框架超越了传统的变换,通过传递函数将类似扩散的核心函数与上界和下界函数相结合。关键性质,如单调性和凹凸性是由简单的,可验证的条件在组成函数保证。这种方法的一个关键优势是,它将非线性结构分解成独立的部分,使其更容易整合社会经济变量。这使得模型能够捕捉不同社会经济群体的非线性变化、阻尼和比例效应。该框架是低参数、有界、连续和模块化的,这使得使用标准软件进行估计变得容易。它的灵活性和优势在两个案例研究中得到说明:(i)运输模式选择的离散选择模型,以及(ii)车辆所有权的非线性逻辑回归模型。在这两种情况下,该框架增强了模型拟合,促进了对尾部行为的更好控制,展示了如何有效地整合异质性,并产生了更精确和行为合理的弹性估计。受控仿真进一步证明了该框架在广泛的非线性过程中的鲁棒性。调整单个子组件导致不同的功能行为,防止向单一的公共形状收敛。这种多样性表明该框架避免了“复制猫”行为或功能崩溃。因此,它的灵活、有界的结构可以根据应用程序进行调整或放松,为调整功能以解决不同的问题提供了几乎无限的可能性。
{"title":"Beyond Box-Cox: A diffusion-inspired functional framework for nonlinear demand and discrete choice modeling","authors":"Jeppe Rich","doi":"10.1016/j.trb.2025.103380","DOIUrl":"10.1016/j.trb.2025.103380","url":null,"abstract":"<div><div>This paper presents a new diffusion-inspired functional framework for modeling nonlinear demand and discrete choice, with applications in transportation and related fields. The framework goes beyond traditional transformations by combining a diffusion-like core function with upper and lower bound functions, linked through a transfer function. Key properties such as monotonicity and concavity or convexity are guaranteed by simple, verifiable conditions on the component functions. A key advantage of this approach is that it breaks the nonlinear structure into separate parts, making it easier to integrate socio-economic variables. This enables the model to capture non-linear shifts, damping, and scaling effects across different socio-economic groups. The framework is low-parametric, bounded, continuous, and modular, which makes it easy to estimate using standard software. Its flexibility and strengths are illustrated in two case studies: (i) a discrete choice model of transport mode selection, and (ii) a nonlinear logistic regression model of vehicle ownership. In both cases, the framework enhances model fit, facilitates better control over tail behavior, demonstrates how heterogeneity can be effectively integrated, and yields more precise and behaviorally plausible elasticity estimates. Controlled simulations further demonstrate the framework’s robustness across a broad range of nonlinear processes. Adjusting the individual sub-components leads to distinct functional behaviors, preventing convergence toward a single common shape. This diversity indicates that the framework avoids ”copy-cat” behavior or functional collapse. As a result, its flexible, bounded structure can be tailored or relaxed depending on the application, offering virtually limitless possibilities for adapting functions to address different problems.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103380"},"PeriodicalIF":6.3,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145786101","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}
引用次数: 0
Seamless urban metro networks: A shared depot perspective on rolling stock scheduling 无缝城市地铁网络:共享车辆段对车辆调度的看法
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-19 DOI: 10.1016/j.trb.2025.103379
Housheng Zhou , Hongyang Wang , Hai Wang , Jianguo Qi , Lixing Yang
This study focuses on a novel integrated optimization problem that involves train timetables and rolling stock circulation plans in urban metro networks that features shared rolling stock depots for multiple interconnected metro lines. An integer programming model is developed to determine train dispatch times, the allocation of rolling stock resources at depots, rolling stock connection, and passenger assignment. The model considers objectives that encompass both passenger service levels and operational costs. To address the computational complexity of large-scale problems, two exact solution approaches are developed. (1) A Benders decomposition algorithm decomposes the proposed model into a rolling stock scheduling problem and a set of independent passenger assignment subproblems. Upon analyzing the theoretical properties of the integer subproblems, these subproblems are replaced by their linear relaxation problems to enhance computational efficiency. (2) An improved Benders decomposition algorithm, which incorporates novel optimality cuts, is designed to accelerate the solution process. Numerical experiments using real-world data from the Xi’an Metro validate the effectiveness of the proposed approaches. Computational results demonstrate that the improved Benders decomposition algorithm consistently yields a high-quality solution for the whole-day case and outperforms the traditional Benders decomposition method and CPLEX solver. Compared with independent depots for each metro line, the shared depot strategy yields a noteworthy 6.8 % reduction in the number of carriages that put into operation. This reduction highlights key improvements in resource utilization, and overall operational effectiveness.
本文研究了一个新的综合优化问题,该问题涉及城市地铁网络中的列车时刻表和车辆流通计划,该网络具有多条相互连接的地铁线路共享车辆库的特点。建立了一个整数规划模型来确定列车调度时间、车辆段资源分配、车辆段连接和乘客分配。该模型考虑的目标包括乘客服务水平和运营成本。为了解决大规模问题的计算复杂性,发展了两种精确求解方法。(1) Benders分解算法将模型分解为一个车辆调度问题和一组独立的乘客分配子问题。在分析整数子问题的理论性质的基础上,将这些子问题替换为它们的线性松弛问题,以提高计算效率。(2)设计了一种改进的Benders分解算法,该算法引入了新的最优切割,以加快求解过程。西安地铁实际数据的数值实验验证了所提方法的有效性。计算结果表明,改进的Benders分解算法在全天情况下都能得到高质量的解,优于传统的Benders分解方法和CPLEX求解器。与每条地铁线路的独立车场相比,共享车场策略使投入运营的车厢数量显著减少了6.8%。这一减少突出了资源利用和整体业务效率方面的关键改进。
{"title":"Seamless urban metro networks: A shared depot perspective on rolling stock scheduling","authors":"Housheng Zhou ,&nbsp;Hongyang Wang ,&nbsp;Hai Wang ,&nbsp;Jianguo Qi ,&nbsp;Lixing Yang","doi":"10.1016/j.trb.2025.103379","DOIUrl":"10.1016/j.trb.2025.103379","url":null,"abstract":"<div><div>This study focuses on a novel integrated optimization problem that involves train timetables and rolling stock circulation plans in urban metro networks that features shared rolling stock depots for multiple interconnected metro lines. An integer programming model is developed to determine train dispatch times, the allocation of rolling stock resources at depots, rolling stock connection, and passenger assignment. The model considers objectives that encompass both passenger service levels and operational costs. To address the computational complexity of large-scale problems, two exact solution approaches are developed. (1) A Benders decomposition algorithm decomposes the proposed model into a rolling stock scheduling problem and a set of independent passenger assignment subproblems. Upon analyzing the theoretical properties of the integer subproblems, these subproblems are replaced by their linear relaxation problems to enhance computational efficiency. (2) An improved Benders decomposition algorithm, which incorporates novel optimality cuts, is designed to accelerate the solution process. Numerical experiments using real-world data from the Xi’an Metro validate the effectiveness of the proposed approaches. Computational results demonstrate that the improved Benders decomposition algorithm consistently yields a high-quality solution for the whole-day case and outperforms the traditional Benders decomposition method and CPLEX solver. Compared with independent depots for each metro line, the shared depot strategy yields a noteworthy 6.8 % reduction in the number of carriages that put into operation. This reduction highlights key improvements in resource utilization, and overall operational effectiveness.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103379"},"PeriodicalIF":6.3,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145785142","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}
引用次数: 0
Robust optimization for truck-and-drone collaboration with travel time uncertainties 考虑旅行时间不确定性的卡车与无人机协同的鲁棒优化
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-17 DOI: 10.1016/j.trb.2025.103378
Wenbo Sun , Lingxiao Wu , Fangni Zhang
Truck-and-drone collaborations have shown great potential in reducing operational costs by fully utilizing the advantages of both trucks and drones. This study considers a Vehicle Routing Problem with Drones (VRPD) for delivery and surveillance tasks after disasters with travel time uncertainties. The trucks and drones can collaborate flexibly to complete all rescue tasks. Specifically, trucks can travel to other nodes after dispatching drones at a node. Each drone can perform multiple types of tasks at various nodes and return to a truck different from the one it originally took off from. In disaster response, trucks and drones often face uncertainty in travel times. To tackle this challenge, this paper develops a robust route optimization method for the proposed truck-and-drone collaborative system. We first formulate the problem as a min-max-min Mixed Integer Linear Programming (MILP) model. Then, we develop a Branch-and-Bound (BnB) algorithm integrated with the Benders Decomposition (BD) method and the Column-and-Constraint Generation (CCG) method. The BnB algorithm can get a better solution with a much smaller optimality gap, compared with the commercial solver Gurobi. Finally, we conduct extensive numerical studies to evaluate the proposed algorithm and test the benefits of robust routing. Numerical results show that the robust route can reduce the average cost by about 5 %, in contrast to the route without considering uncertainties. Sensitivity analysis is also carried out to compare different parameters in the uncertainty set and the truck-and-drone system.
通过充分利用卡车和无人机的优势,卡车和无人机的合作在降低运营成本方面显示出巨大的潜力。本文研究了一种具有飞行时间不确定性的灾害后无人机运输和监视任务的车辆路径问题。卡车和无人机可以灵活协作,完成所有救援任务。具体来说,在一个节点调度无人机后,卡车可以行驶到其他节点。每架无人机都可以在不同的节点执行多种类型的任务,并返回到与最初起飞的卡车不同的卡车上。在灾难响应中,卡车和无人机经常面临出行时间的不确定性。为了解决这一挑战,本文为所提出的卡车和无人机协同系统开发了一种鲁棒的路线优化方法。我们首先将问题表述为最小-最大-最小混合整数线性规划(MILP)模型。然后,结合Benders分解(BD)方法和列约束生成(CCG)方法,提出了分支定界(BnB)算法。与商业求解器Gurobi相比,BnB算法可以以更小的最优性差距获得更好的解。最后,我们进行了广泛的数值研究,以评估所提出的算法和测试鲁棒路由的好处。数值计算结果表明,与不考虑不确定性的路由相比,鲁棒路由的平均成本可降低约5%。对不确定集和卡车-无人机系统的不同参数进行了敏感性分析。
{"title":"Robust optimization for truck-and-drone collaboration with travel time uncertainties","authors":"Wenbo Sun ,&nbsp;Lingxiao Wu ,&nbsp;Fangni Zhang","doi":"10.1016/j.trb.2025.103378","DOIUrl":"10.1016/j.trb.2025.103378","url":null,"abstract":"<div><div>Truck-and-drone collaborations have shown great potential in reducing operational costs by fully utilizing the advantages of both trucks and drones. This study considers a Vehicle Routing Problem with Drones (VRPD) for delivery and surveillance tasks after disasters with travel time uncertainties. The trucks and drones can collaborate flexibly to complete all rescue tasks. Specifically, trucks can travel to other nodes after dispatching drones at a node. Each drone can perform multiple types of tasks at various nodes and return to a truck different from the one it originally took off from. In disaster response, trucks and drones often face uncertainty in travel times. To tackle this challenge, this paper develops a robust route optimization method for the proposed truck-and-drone collaborative system. We first formulate the problem as a min-max-min Mixed Integer Linear Programming (MILP) model. Then, we develop a Branch-and-Bound (BnB) algorithm integrated with the Benders Decomposition (BD) method and the Column-and-Constraint Generation (CCG) method. The BnB algorithm can get a better solution with a much smaller optimality gap, compared with the commercial solver Gurobi. Finally, we conduct extensive numerical studies to evaluate the proposed algorithm and test the benefits of robust routing. Numerical results show that the robust route can reduce the average cost by about 5 %, in contrast to the route without considering uncertainties. Sensitivity analysis is also carried out to compare different parameters in the uncertainty set and the truck-and-drone system.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103378"},"PeriodicalIF":6.3,"publicationDate":"2025-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145786103","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}
引用次数: 0
Road price and capacity policies subject to a fiscal constraint in a city 城市财政约束下的道路价格和通行能力政策
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-15 DOI: 10.1016/j.trb.2025.103361
Tatsuhito Kono, Nozomu Takamura
This paper explores the efficient capacity of the bottleneck and road pricing in a city, subject to the fiscal constraint financing the whole urban road network including the bottleneck. To do this, considering that most cities collect their public fund from property tax, we set three regimes: Regime 1, where congestion pricing is imposed with property tax; Regime 2, where the flat per-kilometer charge is imposed with property tax; Regime 3, where floor area ratio (FAR) regulations and flat per-kilometer charge are imposed with property tax. We derive theoretical properties in each regime. First, in Regime 1, even subject to fiscal constraints, the congestion pricing formula is equal to that of Arnott et al. (1990, 1993), but the optimal capacity should be smaller than that in the presence of a lump-sum tax, reflecting the endogenous marginal cost of public funds. As a result, the congestion pricing revenue exceeds the cost of optimizing the bottleneck capacity. In addition, we show that, only in Regime 3, property tax does not generate deadweight losses owing to the imposition of FAR regulation. Finally, setting the regime of property tax only as the base, our quantitative simulations show that Regime 1 has about 90 % of the welfare increase of the first best, Regime 3 has about 50 % of the increase, and Regime 2 has about 15 % of the increase.
本文研究了在财政约束下包括瓶颈在内的整个城市路网的有效通行能力和道路收费问题。为了做到这一点,考虑到大多数城市从财产税中收取公共资金,我们设定了三种制度:制度一,在征收财产税的同时征收拥堵费;制度2,每公里统一收费与财产税一起征收;制度3,建筑面积比率(FAR)规定和每公里单位收费与财产税一起征收。我们推导出每一种状态的理论性质。首先,在制度1中,即使在财政约束下,拥堵定价公式与Arnott et al.(1990,1993)的公式是相等的,但最优容量应该小于一次性征税时的容量,这反映了公共资金的内生边际成本。因此,拥堵收费的收益超过了优化瓶颈容量的成本。此外,我们还表明,只有在制度3中,财产税才不会因为实施FAR监管而产生无谓损失。最后,仅以财产税制度为基础,我们的定量模拟表明,制度1的福利增幅约为前优的90%,制度3的福利增幅约为50%,制度2的福利增幅约为15%。
{"title":"Road price and capacity policies subject to a fiscal constraint in a city","authors":"Tatsuhito Kono,&nbsp;Nozomu Takamura","doi":"10.1016/j.trb.2025.103361","DOIUrl":"10.1016/j.trb.2025.103361","url":null,"abstract":"<div><div>This paper explores the efficient capacity of the bottleneck and road pricing in a city, subject to the fiscal constraint financing the whole urban road network including the bottleneck. To do this, considering that most cities collect their public fund from property tax, we set three regimes: Regime 1, where congestion pricing is imposed with property tax; Regime 2, where the flat per-kilometer charge is imposed with property tax; Regime 3, where floor area ratio (FAR) regulations and flat per-kilometer charge are imposed with property tax. We derive theoretical properties in each regime. First, in Regime 1, even subject to fiscal constraints, the congestion pricing formula is equal to that of Arnott et al. (1990, 1993), but the optimal capacity should be smaller than that in the presence of a lump-sum tax, reflecting the endogenous marginal cost of public funds. As a result, the congestion pricing revenue exceeds the cost of optimizing the bottleneck capacity. In addition, we show that, only in Regime 3, property tax does not generate deadweight losses owing to the imposition of FAR regulation. Finally, setting the regime of property tax only as the base, our quantitative simulations show that Regime 1 has about 90 % of the welfare increase of the first best, Regime 3 has about 50 % of the increase, and Regime 2 has about 15 % of the increase.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103361"},"PeriodicalIF":6.3,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145759784","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}
引用次数: 0
Locating and pricing park-and-ride service in the era of autonomous vehicles 自动驾驶汽车时代的停车换乘服务定位和定价
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-12 DOI: 10.1016/j.trb.2025.103376
Qingyun Tian , Yun Hui Lin , Kaidi Yang , David Z.W. Wang
This paper studies the optimal location and pricing scheme of Park-and-Ride (P&R) services specifically designed for Autonomous Vehicles (AVs). The unique features of self-cruising and autonomous parking allow AV users to drive directly to the transit stations to access transit service while letting AVs self-cruise and park at P&R stations. This will cause AV users to make different choices regarding P&R stations compared to those driving traditional human-driven vehicles (HVs). Consequently, the layout of P&R stations and service charges designed for AVs may deviate significantly from the existing P&R service design for HVs. Standing from the perspective of P&R service operators, we formulate a bilevel model that captures the intricate interplay between service design and travelers’ choices, which aims to maximize the derived profit for operating P&R services by optimizing the location and pricing scheme of P&R stations. To solve the proposed bilevel programming effectively, we present two exact solution approaches, i.e., the mixed-integer linear programming reformulation approach and value-function-based exact solution approach. Numerical experiments are conducted to evaluate the proposed model and solution methods. Based on the results, we find that the P&R service designs for HVs and AVs are considerably different, and the P&R service will be more advantageous in the era of AVs. Through sensitivity analysis, we analyze the impacts of multiple parameters on the model solutions. The results of this study will provide guidance and insights for the deployment of P&R service in the future mobility system with AVs.
本文研究了自动驾驶汽车(AVs)停车换乘服务的最优位置和定价方案。自动巡航和自动停车的独特功能允许自动驾驶汽车用户直接驾驶到中转站使用交通服务,同时让自动驾驶汽车自行巡航和停车在P&;R站。这将导致自动驾驶汽车用户对P&;R站做出不同的选择,而不是驾驶传统的人力驾驶汽车(HVs)。因此,为自动驾驶汽车设计的P&;R站的布局和服务费可能会与现有的为HVs设计的P&;R服务有很大的偏差。本文从P&;R服务运营商的角度出发,建立了一个双层模型,该模型捕捉了服务设计与旅客选择之间错综复杂的相互作用,旨在通过优化P&;R站点的位置和定价方案,实现P&;R服务运营的利润最大化。为了有效地解决所提出的双层规划问题,我们提出了两种精确解方法,即混合整数线性规划重公式化方法和基于值函数的精确解方法。通过数值实验对所提出的模型和求解方法进行了验证。基于研究结果,我们发现HVs和AVs的P&;R服务设计存在较大差异,并且在AVs时代P&;R服务将更具优势。通过灵敏度分析,分析了多个参数对模型解的影响。本研究结果将为未来自动驾驶汽车出行系统中P&;R服务的部署提供指导和见解。
{"title":"Locating and pricing park-and-ride service in the era of autonomous vehicles","authors":"Qingyun Tian ,&nbsp;Yun Hui Lin ,&nbsp;Kaidi Yang ,&nbsp;David Z.W. Wang","doi":"10.1016/j.trb.2025.103376","DOIUrl":"10.1016/j.trb.2025.103376","url":null,"abstract":"<div><div>This paper studies the optimal location and pricing scheme of Park-and-Ride (P&amp;R) services specifically designed for Autonomous Vehicles (AVs). The unique features of self-cruising and autonomous parking allow AV users to drive directly to the transit stations to access transit service while letting AVs self-cruise and park at P&amp;R stations. This will cause AV users to make different choices regarding P&amp;R stations compared to those driving traditional human-driven vehicles (HVs). Consequently, the layout of P&amp;R stations and service charges designed for AVs may deviate significantly from the existing P&amp;R service design for HVs. Standing from the perspective of P&amp;R service operators, we formulate a bilevel model that captures the intricate interplay between service design and travelers’ choices, which aims to maximize the derived profit for operating P&amp;R services by optimizing the location and pricing scheme of P&amp;R stations. To solve the proposed bilevel programming effectively, we present two exact solution approaches, i.e., the mixed-integer linear programming reformulation approach and value-function-based exact solution approach. Numerical experiments are conducted to evaluate the proposed model and solution methods. Based on the results, we find that the P&amp;R service designs for HVs and AVs are considerably different, and the P&amp;R service will be more advantageous in the era of AVs. Through sensitivity analysis, we analyze the impacts of multiple parameters on the model solutions. The results of this study will provide guidance and insights for the deployment of P&amp;R service in the future mobility system with AVs.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103376"},"PeriodicalIF":6.3,"publicationDate":"2025-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145732477","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}
引用次数: 0
期刊
Transportation Research Part B-Methodological
全部 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