首页 > 最新文献

Transportation Research Part B-Methodological最新文献

英文 中文
Real-time bus control of urban transit networks with overtaking and passenger transfers: A decomposition solution method combined with spatial branch-and-bound 超车换乘城市公交网络实时控制:一种结合空间分支定界的分解求解方法
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-03-01 Epub Date: 2026-01-25 DOI: 10.1016/j.trb.2026.103402
Yin Yuan , Shukai Li , Maximiliano Cubillos , Maurizio Bruglieri
Frequent disturbances and demand fluctuations can result in unreliable bus operations and transfer services. This paper investigates real-time bus control for urban transit networks under dwell and travel time disturbances. The objective is to optimize bus timetable adjustments to minimize the total bus departure deviation, headway deviation, and passenger waiting in a time horizon. We propose a mixed-integer nonlinear programming model under rolling horizon, which incorporates both traffic and passenger load dynamics while accounting for bus overtaking, passenger transfer, and bus capacity limitations. To quickly obtain high-quality solutions to satisfy real-time requirements, we develop an efficient decomposition method combined with spatial branch-and-bound. This method reduces computational complexity by breaking down the network-level problem into smaller-scale line-level problems. It iteratively updates the solution and objective function values by solving a network-level feasibility recovery problem, ensuring coordination among line-level solutions through iterations. Extensive computational experiments demonstrate that our solution algorithm exhibits superior computational efficiency compared to a state-of-the-art solver across different network scales, facilitating a real-time implementation. Furthermore, our approach outperforms conventional schedule- and headway-based control strategies, effectively reducing departure deviation, headway deviation, and passenger waiting time.
频繁的干扰和需求波动可能导致公共汽车运营和换乘服务不可靠。本文研究了居住时间和出行时间干扰下城市公交网络的实时控制问题。目标是优化公交时刻表调整,使公交总发车偏差、车头偏差和乘客等待时间最小化。本文提出了滚动地平线下的混合整数非线性规划模型,该模型在考虑超车、乘客换乘和公交车容量限制的情况下,同时考虑了交通和客运动态。为了快速得到满足实时性要求的高质量解,我们开发了一种结合空间分支定界的高效分解方法。该方法通过将网络级问题分解为更小的线级问题来降低计算复杂度。它通过求解一个网络级可行性恢复问题,迭代更新解和目标函数值,通过迭代保证线级解之间的协调。大量的计算实验表明,与不同网络规模的最先进的求解器相比,我们的解决方案算法显示出卓越的计算效率,促进了实时实现。此外,我们的方法优于传统的基于时刻表和进度的控制策略,有效地减少了发车偏差、车头距偏差和乘客等待时间。
{"title":"Real-time bus control of urban transit networks with overtaking and passenger transfers: A decomposition solution method combined with spatial branch-and-bound","authors":"Yin Yuan ,&nbsp;Shukai Li ,&nbsp;Maximiliano Cubillos ,&nbsp;Maurizio Bruglieri","doi":"10.1016/j.trb.2026.103402","DOIUrl":"10.1016/j.trb.2026.103402","url":null,"abstract":"<div><div>Frequent disturbances and demand fluctuations can result in unreliable bus operations and transfer services. This paper investigates real-time bus control for urban transit networks under dwell and travel time disturbances. The objective is to optimize bus timetable adjustments to minimize the total bus departure deviation, headway deviation, and passenger waiting in a time horizon. We propose a mixed-integer nonlinear programming model under rolling horizon, which incorporates both traffic and passenger load dynamics while accounting for bus overtaking, passenger transfer, and bus capacity limitations. To quickly obtain high-quality solutions to satisfy real-time requirements, we develop an efficient decomposition method combined with spatial branch-and-bound. This method reduces computational complexity by breaking down the network-level problem into smaller-scale line-level problems. It iteratively updates the solution and objective function values by solving a network-level feasibility recovery problem, ensuring coordination among line-level solutions through iterations. Extensive computational experiments demonstrate that our solution algorithm exhibits superior computational efficiency compared to a state-of-the-art solver across different network scales, facilitating a real-time implementation. Furthermore, our approach outperforms conventional schedule- and headway-based control strategies, effectively reducing departure deviation, headway deviation, and passenger waiting time.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"205 ","pages":"Article 103402"},"PeriodicalIF":6.3,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146048183","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
Harnessing household travel survey with smart card data to generate spatiotemporally-diverse activity schedules for transit users 利用家庭旅行调查和智能卡数据,为交通用户生成时空多样化的活动时间表
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-03-01 Epub Date: 2026-01-06 DOI: 10.1016/j.trb.2025.103388
Khoa D. Vo , Eui-Jin Kim , Huichang Lee , Prateek Bansal
Current activity-based models (ABMs) rely on household travel survey (HTS) data to generate daily activity schedules for transit users. However, HTS suffers from limited sampling, resulting in low spatiotemporal diversity. Smart card (SC) data offer broader transit coverage but lack sociodemographic, non-transit trips, and trip-level details, making integration with HTS challenging. This study introduces a novel two-stage data fusion framework that combines detailed but sparse HTS data with high-coverage SC data to generate complete, diverse, and up-to-date activity schedules for transit users. In Stage 1, the framework learns a latent class structure to align the spatiotemporal characteristics of transit trips across datasets and estimates a fused joint distribution over all attributes except the spatiotemporal details of non-transit trips. Stage 2 imputes these missing spatiotemporal details to complete full trip chains. A key innovation is the construction of a latent space with optimal complexity that preserves key statistical properties while enhancing the diversity of synthesized activity patterns. The framework ensures scalability by decomposing the fusion task into analytically tractable sub-problems. The model properties are first validated in a controlled experiment. Further validation using data from 3.4 million SC users in Seoul, South Korea, shows that the fused population closely aligns with external cellular signaling data and significantly outperforms HTS alone – generating up to 2.92 million unique synthetic schedules (an 82.8 ×  increase over HTS). In sum, the proposed method lays the groundwork for integrating diverse data sources into ABMs, enhancing their ability to generate diverse synthetic mobility patterns, including underrepresented segments.
当前基于活动的模型(ABMs)依赖于家庭旅行调查(HTS)数据来生成交通用户的日常活动时间表。然而,高通量遥感的采样有限,导致其时空多样性较低。智能卡(SC)数据提供了更广泛的过境覆盖范围,但缺乏社会人口统计、非过境旅行和旅行级别的详细信息,使得与HTS的整合具有挑战性。本研究引入了一种新的两阶段数据融合框架,该框架将详细但稀疏的HTS数据与高覆盖率的SC数据结合起来,为交通用户生成完整、多样和最新的活动计划。在第一阶段,该框架学习一个潜在的类结构,以对齐跨数据集的过境旅行的时空特征,并估计除非过境旅行的时空细节之外的所有属性的融合联合分布。阶段2将这些缺失的时空细节归罪于完整的行程链。关键的创新是构建具有最佳复杂性的潜在空间,在保留关键统计属性的同时增强合成活动模式的多样性。该框架通过将融合任务分解为可分析处理的子问题来确保可扩展性。首先在一个控制实验中验证了模型的特性。使用来自韩国首尔340万SC用户的数据进行进一步验证,表明融合的种群与外部蜂窝信号数据密切一致,并且显著优于单独的HTS -产生多达292万个独特的合成调度(比HTS增加82.8 × )。总之,所提出的方法为将不同数据源集成到abm中奠定了基础,增强了它们生成多种综合流动性模式的能力,包括未被充分代表的细分市场。
{"title":"Harnessing household travel survey with smart card data to generate spatiotemporally-diverse activity schedules for transit users","authors":"Khoa D. Vo ,&nbsp;Eui-Jin Kim ,&nbsp;Huichang Lee ,&nbsp;Prateek Bansal","doi":"10.1016/j.trb.2025.103388","DOIUrl":"10.1016/j.trb.2025.103388","url":null,"abstract":"<div><div>Current activity-based models (ABMs) rely on household travel survey (HTS) data to generate daily activity schedules for transit users. However, HTS suffers from limited sampling, resulting in low spatiotemporal diversity. Smart card (SC) data offer broader transit coverage but lack sociodemographic, non-transit trips, and trip-level details, making integration with HTS challenging. This study introduces a novel two-stage data fusion framework that combines detailed but sparse HTS data with high-coverage SC data to generate complete, diverse, and up-to-date activity schedules for transit users. In Stage 1, the framework learns a latent class structure to align the spatiotemporal characteristics of transit trips across datasets and estimates a fused joint distribution over all attributes except the spatiotemporal details of non-transit trips. Stage 2 imputes these missing spatiotemporal details to complete full trip chains. A key innovation is the construction of a latent space with optimal complexity that preserves key statistical properties while enhancing the diversity of synthesized activity patterns. The framework ensures scalability by decomposing the fusion task into analytically tractable sub-problems. The model properties are first validated in a controlled experiment. Further validation using data from 3.4 million SC users in Seoul, South Korea, shows that the fused population closely aligns with external cellular signaling data and significantly outperforms HTS alone – generating up to 2.92 million unique synthetic schedules (an 82.8 ×  increase over HTS). In sum, the proposed method lays the groundwork for integrating diverse data sources into ABMs, enhancing their ability to generate diverse synthetic mobility patterns, including underrepresented segments.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"205 ","pages":"Article 103388"},"PeriodicalIF":6.3,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145897955","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
Integrated air-rail scheduling: A branch-and-price approach for adaptive passenger-centric planning 综合空铁调度:以乘客为中心的适应性规划的分支和价格方法
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-02-01 Epub Date: 2025-11-26 DOI: 10.1016/j.trb.2025.103363
Andréas Guitart, Clara Buire
This paper addresses the air-rail schedule synchronisation problem by proposing a novel approach that designs integrated flight and train schedules from scratch. A passenger-centric approach is employed, considering a set of travel preference criteria: door-to-door travel time, price, and transportation mode. The problem is formulated as an adapted version of a Multi-Commodity Flow (MCF) problem on a time-expanded network, and solved through a branch-and-price procedure. To speed-up the solution process, we propose to couple the resolution of the column-generation sub-problem with a pattern search, performed in a preprocessing phase. The proposed methodology is tested on the French transportation network over a five-month period, considering 1500 commodities. The complete schedule is generated in twelve hours, including the preprocessing time. The final schedule satisfies over 95 % of passenger travel preferences, demonstrating the effectiveness of the approach in optimising multimodal connectivity.
本文提出了一种新的方法,从头开始设计集成的航班和火车时刻表,解决了空铁时刻表同步问题。采用了以乘客为中心的方法,考虑了一组旅行偏好标准:门到门的旅行时间、价格和交通方式。该问题被表述为时间扩展网络上的多商品流(MCF)问题的一个改编版本,并通过分支-价格程序来解决。为了加快求解过程,我们建议在预处理阶段将列生成子问题的求解与模式搜索耦合起来。拟议的方法在法国运输网络上进行了为期五个月的测试,考虑了1500种商品。完整的时间表在12小时内生成,包括预处理时间。最终的时间表满足了95%以上的乘客出行偏好,证明了该方法在优化多式联运连通性方面的有效性。
{"title":"Integrated air-rail scheduling: A branch-and-price approach for adaptive passenger-centric planning","authors":"Andréas Guitart,&nbsp;Clara Buire","doi":"10.1016/j.trb.2025.103363","DOIUrl":"10.1016/j.trb.2025.103363","url":null,"abstract":"<div><div>This paper addresses the air-rail schedule synchronisation problem by proposing a novel approach that designs integrated flight and train schedules from scratch. A passenger-centric approach is employed, considering a set of travel preference criteria: door-to-door travel time, price, and transportation mode. The problem is formulated as an adapted version of a Multi-Commodity Flow (MCF) problem on a time-expanded network, and solved through a branch-and-price procedure. To speed-up the solution process, we propose to couple the resolution of the column-generation sub-problem with a pattern search, performed in a preprocessing phase. The proposed methodology is tested on the French transportation network over a five-month period, considering 1500 commodities. The complete schedule is generated in twelve hours, including the preprocessing time. The final schedule satisfies over 95 % of passenger travel preferences, demonstrating the effectiveness of the approach in optimising multimodal connectivity.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103363"},"PeriodicalIF":6.3,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145598638","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 : 2026-02-01 Epub 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":"2026-02-01","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
A new flexible skewed bimodal distribution with multivariate extensions: Theory and application to traffic crash injury severity analysis 一种具有多元扩展的柔性偏斜双峰分布:在交通碰撞损伤严重程度分析中的理论与应用
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-02-01 Epub Date: 2025-12-06 DOI: 10.1016/j.trb.2025.103364
Chandra R. Bhat
This paper introduces a proper multivariate flexible continuous parametric distribution, a first to our knowledge, that allows for asymmetric bimodality in each univariate dimension. The distribution is developed through a combination of an approach to generate bimodality and a Yeo-Johnson (YJ)-based transformation. A number of properties of the proposed distribution are stated and proved, including a computationally easy way to generate random variates from the proposed multivariate density. An application of the proposed distribution is demonstrated to analyze injury severity using data drawn from the Texas Department of Transportation (TxDOT) crash database of two-vehicle crashes at intersections. The proposed distribution may be applied to a number of different econometric modeling contexts in both a univariate and multivariate context, and in a whole variety of fields to consider bimodal asymmetry in stochastic distributions.
本文介绍了一种合适的多元柔性连续参数分布,这是我们所知的第一次,它允许在每个单变量维度上存在不对称双峰。该分布是通过生成双峰的方法和基于Yeo-Johnson (YJ)的转换相结合而开发的。本文陈述并证明了所提出的分布的一些性质,包括从所提出的多变量密度生成随机变量的计算简便方法。本文演示了该分布的一个应用,利用德克萨斯州交通部(TxDOT)碰撞数据库中交叉路口两车碰撞的数据来分析伤害严重程度。所提出的分布可以应用于许多不同的计量经济建模背景,在单变量和多变量的背景下,以及在各种各样的领域,以考虑随机分布中的双峰不对称性。
{"title":"A new flexible skewed bimodal distribution with multivariate extensions: Theory and application to traffic crash injury severity analysis","authors":"Chandra R. Bhat","doi":"10.1016/j.trb.2025.103364","DOIUrl":"10.1016/j.trb.2025.103364","url":null,"abstract":"<div><div>This paper introduces a proper multivariate flexible continuous parametric distribution, a first to our knowledge, that allows for asymmetric bimodality in each univariate dimension. The distribution is developed through a combination of an approach to generate bimodality and a Yeo-Johnson (YJ)-based transformation. A number of properties of the proposed distribution are stated and proved, including a computationally easy way to generate random variates from the proposed multivariate density. An application of the proposed distribution is demonstrated to analyze injury severity using data drawn from the Texas Department of Transportation (TxDOT) crash database of two-vehicle crashes at intersections. The proposed distribution may be applied to a number of different econometric modeling contexts in both a univariate and multivariate context, and in a whole variety of fields to consider bimodal asymmetry in stochastic distributions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103364"},"PeriodicalIF":6.3,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145689758","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 : 2026-02-01 Epub 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":"2026-02-01","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
Seamless urban metro networks: A shared depot perspective on rolling stock scheduling 无缝城市地铁网络:共享车辆段对车辆调度的看法
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-02-01 Epub 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":"2026-02-01","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
Modeling multilane traffic flow in Lagrangian coordinates: Formulation and implementation 拉格朗日坐标下的多车道交通流建模:制定与实现
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-02-01 Epub 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":"2026-02-01","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
Joint optimization of train services and freight delivery in a metro-based underground logistics system 以地铁为基础的地下物流系统中列车服务和货物交付的联合优化
IF 6.3 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-02-01 Epub Date: 2025-12-10 DOI: 10.1016/j.trb.2025.103377
Siqiao Li , Xiaoning Zhu , Pan Shang , Tom Van Woensel , Yu Yao
This study investigates a shared-use metro network in which passengers and freight are transported on different trains, enhancing resource utilization and promoting the sustainable growth of urban areas. From the perspective of public authorities seeking to balance the interests of all stakeholders, we address the tactical problem of determining the optimal number, stop pattern, and schedule of freight train services needed for freight delivery, while maintaining high passenger service quality by minor timetable adjustments. A non-convex mixed-integer quadratic programming model is developed to minimize freight transportation, train operational costs, and deviations in passenger train schedules. A Frank-Wolfe-based heuristic is developed with a novel gradient approximation that accounts for the hierarchy between binary and continuous decisions. The step size is defined as a discrete gap between disjoint subspaces determined by train operations, reflecting that partially shifting flow does not effectively impact the objective due to the indivisibility of train activation. Experiments are conducted based on instances generated from the Beijing Metro network. The results show that under high freight demand, dedicated freight trains cause less passenger delay than utilizing existing passenger trains. Prioritizing passenger schedules shifts freight to lower-priority lines, while incorporating a quadratic consolidation cost helps reduce fragmentation and excessive transhipments.
本研究探讨了一种乘客和货物在不同列车上运输的共享地铁网络,提高了资源利用率,促进了城市地区的可持续增长。从公共当局寻求平衡所有利益相关者利益的角度出发,我们解决了确定货运列车服务所需的最佳数量、停靠模式和时间表的战术问题,同时通过微小的时间表调整保持高客运服务质量。提出了一种非凸混合整数二次规划模型,以最小化货物运输量、列车运行成本和旅客列车调度偏差。提出了一种基于frank - wolfe的启发式算法,该算法采用了一种新颖的梯度近似,可以解释二元决策和连续决策之间的层次关系。步长定义为由列车运行决定的不相连子空间之间的离散间隙,反映了由于列车激活的不可分割性,部分移动的流不能有效地影响目标。基于北京地铁网络生成的实例进行了实验。结果表明,在高货运需求下,货运专列比利用现有客运专列造成的旅客延误少。优先安排客运时刻表可以将货运转移到较低优先级的线路,同时纳入二次合并成本有助于减少碎片化和过度转运。
{"title":"Joint optimization of train services and freight delivery in a metro-based underground logistics system","authors":"Siqiao Li ,&nbsp;Xiaoning Zhu ,&nbsp;Pan Shang ,&nbsp;Tom Van Woensel ,&nbsp;Yu Yao","doi":"10.1016/j.trb.2025.103377","DOIUrl":"10.1016/j.trb.2025.103377","url":null,"abstract":"<div><div>This study investigates a shared-use metro network in which passengers and freight are transported on different trains, enhancing resource utilization and promoting the sustainable growth of urban areas. From the perspective of public authorities seeking to balance the interests of all stakeholders, we address the tactical problem of determining the optimal number, stop pattern, and schedule of freight train services needed for freight delivery, while maintaining high passenger service quality by minor timetable adjustments. A non-convex mixed-integer quadratic programming model is developed to minimize freight transportation, train operational costs, and deviations in passenger train schedules. A Frank-Wolfe-based heuristic is developed with a novel gradient approximation that accounts for the hierarchy between binary and continuous decisions. The step size is defined as a discrete gap between disjoint subspaces determined by train operations, reflecting that partially shifting flow does not effectively impact the objective due to the indivisibility of train activation. Experiments are conducted based on instances generated from the Beijing Metro network. The results show that under high freight demand, dedicated freight trains cause less passenger delay than utilizing existing passenger trains. Prioritizing passenger schedules shifts freight to lower-priority lines, while incorporating a quadratic consolidation cost helps reduce fragmentation and excessive transhipments.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103377"},"PeriodicalIF":6.3,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145732490","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 : 2026-02-01 Epub 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":"2026-02-01","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
期刊
Transportation Research Part B-Methodological
全部 Basin Res. Chin. J. Phys. Engineering Science and Technology, an International Journal Mon. Weather Rev. J QUANT SPECTROSC RA Carbon Balance Manage. Bulletin of the International Institute of Seismology and Earthquake Engineering ECOSYSTEMS Tissue Eng. Part A 2012 IEEE International Workshop on Antenna Technology (iWAT) Acta Oceanolog. Sin. Global Biogeochem. Cycles ADV CHRONIC KIDNEY D Ecol. Eng. EUR PHYS J-APPL PHYS ArcheoSci.-Rev. Archeom. Geosci. Model Dev. ACTA CARDIOL SIN Opt. Express "Radiation and Risk" Bulletin of the National Radiation and Epidemiological Registry Memai Heiko Igaku High Temp. Nanomanufacturing and Metrology Ann. Glaciol. OCEAN SCI J Espacio Tiempo y Forma. Serie VI, Geografía ASTRON ASTROPHYS Laser Phys. Biomed Instrum Technol Environ. Educ. Res, Int. J. Biometeorol. ACTA OBSTET GYN SCAN J APPL METEOROL CLIM Journal of Popular Television Phys. Chem. Miner. Ecol. Res. Family Practice Management J NONLINEAR OPT PHYS Mod. Phys. Lett. A Milli Egitim Eurasian Chemico-Technological Journal Geochem. Int. Transactions of the Korean Hydrogen and New Energy Society 2013 IEEE International Conference on Computer Vision High Pressure Res. Journal of Equine Science Clean Technol. Environ. Policy Atmos. Meas. Tech. ACTA PETROL SIN ADV ANAT PATHOL REV MEX CIENC GEOL Org. Geochem. ACTA CARDIOL Ecol. Monogr. Stapp car crash journal Geobiology ENVIRON GEOL CRIT REV ENV SCI TEC Hydrogeol. J. CHIN OPT LETT PALAEOGEOGR PALAEOCL IZV-PHYS SOLID EART+ SYMMETRY INTEGR GEOM GEOHERITAGE INFRARED PHYS TECHN Geol. Ore Deposits LIGHT-SCI APPL AM J MED QUAL Phys. Rev. Appl. EUR PHYS J-SPEC TOP Military Law Review ARCT ANTARCT ALP RES Communications Earth & Environment Acta Geophys. 国际生物医学工程杂志 航空科学与技术(英文) 2011 International Conference on Infrared, Millimeter, and Terahertz Waves GSA Today Archaeol. Anthropol. Sci. Ecol. Indic. Astrophys. J. Suppl. Ser. Acta Odontol. Scand. 2012 38th IEEE Photovoltaic Specialists Conference Aust. J. Earth Sci. ACTA DERM-VENEREOL Ethnobotany Research and Applications ECOL RESTOR Chin. Phys. B ERN: Other Macroeconomics: Aggregative Models (Topic) J. Geog. Sci. Aquat. Geochem. 血栓与止血学 Clim. Change Focus on Autism and Other Developmental Disabilities Acta Geochimica Atmos. Chem. Phys. Earth Syst. Dyn. Dinbilimleri Akademik Arastirma Dergisi-Journal of Academic Research in Religious Sciences Contrib. Mineral. Petrol. Ann. Phys.
×
引用
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