首页 > 最新文献

Transportation Research Part C-Emerging Technologies最新文献

英文 中文
A foundational individual mobility prediction model based on open-source large language models 基于开源大型语言模型的基本个体移动性预测模型
IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-10 DOI: 10.1016/j.trc.2026.105562
Zhenlin Qin , Leizhen Wang , Yancheng Ling , Francisco Camara Pereira , Zhenliang Ma
Individual mobility prediction plays a key role in urban transport, enabling personalized service recommendations and effective travel management. It is widely modeled by data-driven methods such as machine learning, deep learning, as well as classical econometric methods to capture key features of mobility patterns. However, such methods are hindered in promoting further transferability and robustness due to limited capacity to learn mobility patterns from different data sources, predict in out-of-distribution settings (a.k.a “zero-shot”). To address this challenge, this paper introduces MoBLLM, a foundational model for individual mobility prediction that aims to learn a shared and transferable representation of mobility behavior across heterogeneous data sources. Based on a lightweight open-source large language model (LLM), MoBLLM employs Parameter-Efficient Fine-Tuning (PEFT) techniques to create a cost-effective training pipeline, avoiding the need for large-scale GPU clusters while maintaining strong performance. We conduct extensive experiments on six real-world mobility datasets to evaluate its accuracy, robustness, and transferability across varying temporal scales (years), spatial contexts (cities), and situational conditions (e.g., disruptions and interventions). MoBLLM achieves the best F1 score and accuracy across all datasets compared with state-of-the-art deep learning models and shows better transferability and cost efficiency than commercial LLMs. Further experiments reveal its robustness under network changes, policy interventions, special events, and incidents. These results indicate that MoBLLM provides a generalizable modeling foundation for individual mobility behavior, enabling more reliable and adaptive personalized information services for transportation management.
个人出行预测在城市交通中发挥着关键作用,可以实现个性化的服务推荐和有效的出行管理。它被广泛地通过数据驱动的方法建模,如机器学习、深度学习,以及经典的计量经济学方法来捕捉流动性模式的关键特征。然而,由于从不同数据源学习迁移模式的能力有限,这些方法在促进进一步的可转移性和鲁棒性方面受到阻碍,在分布外设置(又称“零概率”)中进行预测。为了应对这一挑战,本文介绍了MoBLLM,这是一个用于个人移动性预测的基础模型,旨在学习跨异构数据源的移动性行为的共享和可转移表示。基于轻量级的开源大型语言模型(LLM), MoBLLM采用参数高效微调(PEFT)技术来创建一个具有成本效益的训练管道,避免了对大规模GPU集群的需求,同时保持了强大的性能。我们在六个真实世界的移动数据集上进行了广泛的实验,以评估其准确性、稳健性和跨不同时间尺度(年)、空间背景(城市)和情景条件(例如中断和干预)的可转移性。与最先进的深度学习模型相比,MoBLLM在所有数据集上获得了最好的F1分数和准确性,并且比商业llm具有更好的可移植性和成本效率。进一步的实验表明,该方法在网络变化、政策干预、特殊事件和事件下具有鲁棒性。这些结果表明,MoBLLM为个体出行行为提供了一个通用的建模基础,为交通管理提供了更可靠、更自适应的个性化信息服务。
{"title":"A foundational individual mobility prediction model based on open-source large language models","authors":"Zhenlin Qin ,&nbsp;Leizhen Wang ,&nbsp;Yancheng Ling ,&nbsp;Francisco Camara Pereira ,&nbsp;Zhenliang Ma","doi":"10.1016/j.trc.2026.105562","DOIUrl":"10.1016/j.trc.2026.105562","url":null,"abstract":"<div><div>Individual mobility prediction plays a key role in urban transport, enabling personalized service recommendations and effective travel management. It is widely modeled by data-driven methods such as machine learning, deep learning, as well as classical econometric methods to capture key features of mobility patterns. However, such methods are hindered in promoting further transferability and robustness due to limited capacity to learn mobility patterns from different data sources, predict in out-of-distribution settings (a.k.a “zero-shot”). To address this challenge, this paper introduces MoBLLM, a foundational model for individual mobility prediction that aims to learn a shared and transferable representation of mobility behavior across heterogeneous data sources. Based on a lightweight open-source large language model (LLM), MoBLLM employs Parameter-Efficient Fine-Tuning (PEFT) techniques to create a cost-effective training pipeline, avoiding the need for large-scale GPU clusters while maintaining strong performance. We conduct extensive experiments on six real-world mobility datasets to evaluate its accuracy, robustness, and transferability across varying temporal scales (years), spatial contexts (cities), and situational conditions (e.g., disruptions and interventions). MoBLLM achieves the best F1 score and accuracy across all datasets compared with state-of-the-art deep learning models and shows better transferability and cost efficiency than commercial LLMs. Further experiments reveal its robustness under network changes, policy interventions, special events, and incidents. These results indicate that MoBLLM provides a generalizable modeling foundation for individual mobility behavior, enabling more reliable and adaptive personalized information services for transportation management.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"185 ","pages":"Article 105562"},"PeriodicalIF":7.6,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146152644","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
Collaborative optimization of train timetabling with maintenance window setting and maintenance scheduling considering fluctuating daily train volumes and dynamic maintenance demands 考虑波动日车量和动态维修需求的列车调度与维修窗口设置和维修调度协同优化
IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-09 DOI: 10.1016/j.trc.2026.105552
Xuze Ye , Yijia Du , Haonan Yang , Jinshan Pan , Shaoquan Ni , Dingjun Chen
Coordinating transport and maintenance in railway operations is difficult. The complexity induced by fluctuating daily train volumes on railway corridors has motivated us to propose a dynamic maintenance scheduling mode that increases the routine maintenance flexibility to scheduling more maintenance activities on days with lower train volumes to reduce the burden on track resources. Some activities of railway assets with relatively mature condition-monitoring technology are scheduled based on maintenance-condition thresholds. Within a planning horizon of several days, dynamic maintenance demands are satisfied by scheduling maintenance activities based on their flexible maintenance date or maintenance-condition threshold, which are coordinated with fluctuating daily train volumes. To reduce maintenance-induced interference on train operations and schedule the maximum possible maintenance activities within the planning horizon, an integer linear programming model is proposed to collaboratively optimize daily train timetabling with maintenance window setting and maintenance scheduling, where the duration and maintenance content of each maintenance window on each day are determined based on dynamic maintenance demands and daily train volumes. To solve large-scale instances, a Lagrangian relaxation-based heuristic algorithm is developed in which the primal problem is decomposed into multiple day- and section-specific subproblems. The effectiveness of the collaborative optimization method and performance of the algorithm are verified for a real-world case. Our method can effectively satisfy dynamic maintenance demands under fluctuating daily train volumes. Moreover, we develop an application of our method to the entire life cycle of railways using the rolling horizon framework.
在铁路运营中协调运输和维修是困难的。鉴于铁路走廊日车流量波动带来的复杂性,我们提出了一种动态维修调度模式,通过增加日常维修的灵活性,在车流量较低的日子安排更多的维修活动,以减轻轨道资源的负担。一些状态监测技术相对成熟的铁路资产的活动是基于维护状态阈值进行调度的。在数天的规划范围内,根据灵活的维护日期或维护条件阈值来安排维护活动,并与波动的日列车量相协调,以满足动态维护需求。为了减少维修对列车运行的干扰,在计划范围内安排尽可能多的维修活动,提出了一种基于维修窗口设置和维修计划协同优化列车日调度的整数线性规划模型,其中每个维修窗口每天的持续时间和维修内容是根据动态维修需求和日列车量来确定的。为了解决大规模实例,提出了一种基于拉格朗日松弛的启发式算法,该算法将原问题分解为多个特定日期和特定区域的子问题。通过实例验证了协同优化方法的有效性和算法的性能。该方法能有效地满足日车流量波动情况下的动态维修需求。此外,我们开发了一个应用我们的方法在整个生命周期的铁路使用滚动地平线框架。
{"title":"Collaborative optimization of train timetabling with maintenance window setting and maintenance scheduling considering fluctuating daily train volumes and dynamic maintenance demands","authors":"Xuze Ye ,&nbsp;Yijia Du ,&nbsp;Haonan Yang ,&nbsp;Jinshan Pan ,&nbsp;Shaoquan Ni ,&nbsp;Dingjun Chen","doi":"10.1016/j.trc.2026.105552","DOIUrl":"10.1016/j.trc.2026.105552","url":null,"abstract":"<div><div>Coordinating transport and maintenance in railway operations is difficult. The complexity induced by fluctuating daily train volumes on railway corridors has motivated us to propose a dynamic maintenance scheduling mode that increases the routine maintenance flexibility to scheduling more maintenance activities on days with lower train volumes to reduce the burden on track resources. Some activities of railway assets with relatively mature condition-monitoring technology are scheduled based on maintenance-condition thresholds. Within a planning horizon of several days, dynamic maintenance demands are satisfied by scheduling maintenance activities based on their flexible maintenance date or maintenance-condition threshold, which are coordinated with fluctuating daily train volumes. To reduce maintenance-induced interference on train operations and schedule the maximum possible maintenance activities within the planning horizon, an integer linear programming model is proposed to collaboratively optimize daily train timetabling with maintenance window setting and maintenance scheduling, where the duration and maintenance content of each maintenance window on each day are determined based on dynamic maintenance demands and daily train volumes. To solve large-scale instances, a Lagrangian relaxation-based heuristic algorithm is developed in which the primal problem is decomposed into multiple day- and section-specific subproblems. The effectiveness of the collaborative optimization method and performance of the algorithm are verified for a real-world case. Our method can effectively satisfy dynamic maintenance demands under fluctuating daily train volumes. Moreover, we develop an application of our method to the entire life cycle of railways using the rolling horizon framework.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"185 ","pages":"Article 105552"},"PeriodicalIF":7.6,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146152662","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
Developing a personalised end-to-end optimisation algorithm for smart parking systems 为智能停车系统开发个性化的端到端优化算法
IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-06 DOI: 10.1016/j.trc.2026.105548
Jingshuo Qiu , Yuxiang Feng , Simon Dale , Mohammed Quddus , Mireille Elhajj , Washington Yotto Ochieng
Rapid economic growth and technological advancement have fostered increased car ownership around the world. Despite the critical role of vehicles in modern life, parking-related challenges persist, leading to negative externalities such as delays, fuel consumption, and environmental impacts. Although Smart Parking Systems (SPSs) have been developed to address these parking issues, they typically only provide available parking spaces with direct walking access from a car park to a destination, thereby restricting the range of parking options available to drivers. By expanding the parking allocation framework to consider the entire journey from origin to destination rather than solely to a car park, a wider range of available parking options can be explored, which may yield more optimal solutions for reducing negative externalities. In addition, SPSs usually assume uniform parking preferences among drivers, which may not reflect the diverse preferences observed in real-world scenarios. To accommodate varying individual preferences, a personalised parking solution is preferred to optimise parking allocation with a particular focus on alleviating negative externalities. Therefore, this paper develops a personalised end-to-end parking allocation algorithm using Multi-Agent Reinforcement Learning (MARL) to broaden the search for available parking spaces and provide intermodal travel solutions to help drivers reach their destinations from car parks. Real-world data from Nottingham, UK, are used to calibrate the simulation model which is employed to evaluate the learning performance of MARL algorithms, including Deep Q-Network (DQN) and Advantage Actor-Critic (A2C). Additionally, as two commonly-used methods for multi-attribute decision making problems, Grey Relational Analysis (GRA) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) are compared in this paper for their effectiveness in modelling personalised parking profiles. The results demonstrate the superiority of the A2C-GRA algorithm, with a significant average total reward improvement of 19% over benchmark models at 95% confidence interval. On average, the travel time and distance optimised by the A2C-GRA algorithm are 39 min and 6.6 km, respectively, representing reductions of 5.22% and 3.62% compared to the benchmark models.
快速的经济增长和技术进步促进了世界各地汽车保有量的增加。尽管车辆在现代生活中发挥着至关重要的作用,但与停车相关的挑战仍然存在,导致诸如延误、燃料消耗和环境影响等负面外部性。虽然智能停车系统(SPSs)已经开发出来解决这些停车问题,但它们通常只提供从停车场直接步行到目的地的可用停车位,从而限制了司机的停车选择范围。通过扩展停车分配框架,考虑从起点到目的地的整个旅程,而不仅仅是一个停车场,可以探索更广泛的可用停车选择,这可能会产生更优的解决方案,以减少负外部性。此外,SPSs通常假设驾驶员的停车偏好是统一的,这可能无法反映在现实场景中观察到的不同偏好。为了适应不同的个人偏好,个性化的停车解决方案可以优化停车分配,并特别关注减轻负面外部性。因此,本文开发了一种使用多智能体强化学习(MARL)的个性化端到端停车分配算法,以扩大对可用停车位的搜索,并提供多式联运出行解决方案,帮助司机从停车场到达目的地。来自英国诺丁汉的真实世界数据用于校准仿真模型,该模型用于评估MARL算法的学习性能,包括Deep Q-Network (DQN)和Advantage Actor-Critic (A2C)。此外,作为多属性决策问题的两种常用方法,灰色关联分析(GRA)和理想解相似偏好排序技术(TOPSIS)在个性化停车配置模型建模中的有效性进行了比较。结果证明了A2C-GRA算法的优越性,在95%置信区间内,平均总奖励比基准模型显著提高19%。A2C-GRA算法优化后的平均行驶时间和距离分别为39 min和6.6 km,与基准模型相比分别减少了5.22%和3.62%。
{"title":"Developing a personalised end-to-end optimisation algorithm for smart parking systems","authors":"Jingshuo Qiu ,&nbsp;Yuxiang Feng ,&nbsp;Simon Dale ,&nbsp;Mohammed Quddus ,&nbsp;Mireille Elhajj ,&nbsp;Washington Yotto Ochieng","doi":"10.1016/j.trc.2026.105548","DOIUrl":"10.1016/j.trc.2026.105548","url":null,"abstract":"<div><div>Rapid economic growth and technological advancement have fostered increased car ownership around the world. Despite the critical role of vehicles in modern life, parking-related challenges persist, leading to negative externalities such as delays, fuel consumption, and environmental impacts. Although Smart Parking Systems (SPSs) have been developed to address these parking issues, they typically only provide available parking spaces with direct walking access from a car park to a destination, thereby restricting the range of parking options available to drivers. By expanding the parking allocation framework to consider the entire journey from origin to destination rather than solely to a car park, a wider range of available parking options can be explored, which may yield more optimal solutions for reducing negative externalities. In addition, SPSs usually assume uniform parking preferences among drivers, which may not reflect the diverse preferences observed in real-world scenarios. To accommodate varying individual preferences, a personalised parking solution is preferred to optimise parking allocation with a particular focus on alleviating negative externalities. Therefore, this paper develops a personalised end-to-end parking allocation algorithm using Multi-Agent Reinforcement Learning (MARL) to broaden the search for available parking spaces and provide intermodal travel solutions to help drivers reach their destinations from car parks. Real-world data from Nottingham, UK, are used to calibrate the simulation model which is employed to evaluate the learning performance of MARL algorithms, including Deep Q-Network (DQN) and Advantage Actor-Critic (A2C). Additionally, as two commonly-used methods for multi-attribute decision making problems, Grey Relational Analysis (GRA) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) are compared in this paper for their effectiveness in modelling personalised parking profiles. The results demonstrate the superiority of the A2C-GRA algorithm, with a significant average total reward improvement of 19% over benchmark models at 95% confidence interval. On average, the travel time and distance optimised by the A2C-GRA algorithm are 39 min and 6.6 km, respectively, representing reductions of 5.22% and 3.62% compared to the benchmark models.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"185 ","pages":"Article 105548"},"PeriodicalIF":7.6,"publicationDate":"2026-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146135135","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
Towards unified estimation and calibration in transport models: Integrating micro-level behaviour and macro-level performance 迈向运输模型的统一估计和校准:整合微观层面的行为和宏观层面的表现
IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-05 DOI: 10.1016/j.trc.2026.105514
Ali Najmi , Michel Bierlaire , Travis Waller , Taha H. Rashidi
Disaggregated models, such as activity-based and random utility-based frameworks, play a central role in travel behaviour analysis and urban transport planning. However, conventional modelling practices often follow a sequential estimation-calibration process that introduces challenges such as error propagation, inconsistent value-of-time estimation, and poor alignment between micro-level behavioural outputs and macro-level system performance. This paper addresses these issues by proposing an integrated modelling framework that simultaneously estimates discrete choice parameters and calibrates system-level constraints, such as observed traffic counts, OD flows, and reference Value of Time (VoT) targets, within a unified optimisation structure. The proposed approach embeds macro-level calibration objectives directly into the estimation of mode, destination, and route choice models, enabling coherent behavioural interpretation while ensuring system-wide consistency. We implement and evaluate this framework on synthetic networks with varying complexity, employing both global optimisation and Bayesian calibration methods. The results demonstrate that the developed model variants consistently outperform traditional log-likelihood-based models in replicating key system metrics, while maintaining plausible and stable behavioural parameters.
分类模型,如基于活动和基于随机效用的框架,在旅行行为分析和城市交通规划中发挥着核心作用。然而,传统的建模实践通常遵循顺序估计-校准过程,这引入了诸如误差传播、不一致的时间值估计以及微观级行为输出和宏观级系统性能之间的不一致等挑战。本文通过提出一个集成的建模框架来解决这些问题,该框架同时估计离散选择参数并校准系统级约束,例如观察到的交通计数,OD流量和参考时间值(VoT)目标,在统一的优化结构中。所提出的方法将宏观层面的校准目标直接嵌入到模式、目的地和路线选择模型的估计中,从而在确保系统范围一致性的同时实现连贯的行为解释。我们采用全局优化和贝叶斯校准方法,在不同复杂性的合成网络上实现和评估该框架。结果表明,开发的模型变体在复制关键系统指标方面始终优于传统的基于对数似然的模型,同时保持可信和稳定的行为参数。
{"title":"Towards unified estimation and calibration in transport models: Integrating micro-level behaviour and macro-level performance","authors":"Ali Najmi ,&nbsp;Michel Bierlaire ,&nbsp;Travis Waller ,&nbsp;Taha H. Rashidi","doi":"10.1016/j.trc.2026.105514","DOIUrl":"10.1016/j.trc.2026.105514","url":null,"abstract":"<div><div>Disaggregated models, such as activity-based and random utility-based frameworks, play a central role in travel behaviour analysis and urban transport planning. However, conventional modelling practices often follow a sequential estimation-calibration process that introduces challenges such as error propagation, inconsistent value-of-time estimation, and poor alignment between micro-level behavioural outputs and macro-level system performance. This paper addresses these issues by proposing an integrated modelling framework that simultaneously estimates discrete choice parameters and calibrates system-level constraints, such as observed traffic counts, OD flows, and reference Value of Time (VoT) targets, within a unified optimisation structure. The proposed approach embeds macro-level calibration objectives directly into the estimation of mode, destination, and route choice models, enabling coherent behavioural interpretation while ensuring system-wide consistency. We implement and evaluate this framework on synthetic networks with varying complexity, employing both global optimisation and Bayesian calibration methods. The results demonstrate that the developed model variants consistently outperform traditional log-likelihood-based models in replicating key system metrics, while maintaining plausible and stable behavioural parameters.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"185 ","pages":"Article 105514"},"PeriodicalIF":7.6,"publicationDate":"2026-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146135141","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
An agent-based approach for travel mode choice equilibrium problem in MaaS considering heterogeneous users 考虑异构用户的MaaS中基于agent的出行方式选择均衡问题
IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-04 DOI: 10.1016/j.trc.2026.105534
Yifan Zhang , Meng Xu , Wenxiang Wu
Accompanying the rising applications of Mobility as a Service (MaaS), it is crucial for understanding user mode choices. This paper defines the travel mode choice equilibrium of heterogeneous users in MaaS and derives its existence conditions. It further identifies cutoff value of time (VOT) thresholds that induce mode shifts, mainly influenced by the prices of different modes and the transfer time difference. The relationship between cutoff VOTs and boundary VOTs is analyzed to clarify their roles in determining the mode choice equilibrium. A heterogeneous agent-based mode choice (HAMC) approach is proposed to approximate mode choice equilibrium of heterogeneous users in MaaS, handling the inherent non-convexity. A case study using real Beijing MaaS data demonstrates that the proposed approach converges to the mode choice equilibrium and reveals that price interventions and transfer time-related interventions primarily influence high-VOT car-owning users and low- to medium-VOT non-car-owning users, respectively.
随着移动即服务(MaaS)应用的兴起,理解用户模式选择至关重要。定义了MaaS系统中异构用户的出行方式选择均衡,并推导了其存在条件。进一步确定了引起模式转移的时间阈值的截止值,主要受不同模式的价格和转移时差的影响。分析了截止点和边界点之间的关系,阐明了它们在确定模式选择平衡中的作用。提出了一种基于异构agent的模式选择(HAMC)方法来逼近MaaS中异构用户的模式选择均衡,处理了MaaS中固有的非凸性。基于北京MaaS数据的实证研究表明,该方法收敛于模式选择均衡,并揭示了价格干预和转移时间相关干预分别主要影响高vot有车用户和中低vot无车用户。
{"title":"An agent-based approach for travel mode choice equilibrium problem in MaaS considering heterogeneous users","authors":"Yifan Zhang ,&nbsp;Meng Xu ,&nbsp;Wenxiang Wu","doi":"10.1016/j.trc.2026.105534","DOIUrl":"10.1016/j.trc.2026.105534","url":null,"abstract":"<div><div>Accompanying the rising applications of Mobility as a Service (MaaS), it is crucial for understanding user mode choices. This paper defines the travel mode choice equilibrium of heterogeneous users in MaaS and derives its existence conditions. It further identifies cutoff value of time (VOT) thresholds that induce mode shifts, mainly influenced by the prices of different modes and the transfer time difference. The relationship between cutoff VOTs and boundary VOTs is analyzed to clarify their roles in determining the mode choice equilibrium. A heterogeneous agent-based mode choice (HAMC) approach is proposed to approximate mode choice equilibrium of heterogeneous users in MaaS, handling the inherent non-convexity. A case study using real Beijing MaaS data demonstrates that the proposed approach converges to the mode choice equilibrium and reveals that price interventions and transfer time-related interventions primarily influence high-VOT car-owning users and low- to medium-VOT non-car-owning users, respectively.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"185 ","pages":"Article 105534"},"PeriodicalIF":7.6,"publicationDate":"2026-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146135146","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
Multi-agent reinforcement learning with a hybrid sequential reward feedback strategy for dynamic multi-modal traffic assignment 基于混合顺序奖励反馈策略的多智能体强化学习用于动态多模式交通分配
IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-03 DOI: 10.1016/j.trc.2026.105545
Dongyue Cun , Muqing Du , Lin Cheng , Anthony Chen
Urbanization and the expansion of transportation modes have exacerbated the challenges of understanding travelers’ decision-making processes regarding route choice across various transportation modes. This paper proposes a novel macroscopic hybrid sequential game method using multi-agent reinforcement learning (MARL) to address issues of computational efficiency and behavioral complexity in multi-modal transportation network simulations. Specifically, agents’ perception behaviors are modeled as a sequential decision-making process considering road capacity constraints, which helps estimate travel time under congestion effects in the multi-modal traffic assignment. In addition, a hybrid reward framework is proposed, providing system-level reward to guide the multi-agent system towards different Nash equilibria, thereby reducing policy fluctuations. To simulate interactions between agents of different transportation modes, a multi-edge representation and reward structures designed for car, bus, priority bus, and metro modes are adopted to handle the mixed traffic flow through the same road. Furthermore, our approach uses a mean-field multi-agent deep Q-learning method to consider both mode and route choice, simplifying agent interactions through mean-field theory and clustering agents with the same origin–destination (OD) demands. Experimental results demonstrate that the hybrid sequential feedback strategy outperforms the simultaneous feedback strategy regarding convergence speed, agent reward distribution, and network flow distribution. Furthermore, the proposed method is tested on the Sioux-Falls network to verify its computational efficiency in three network change scenarios (disruption, road reconstruction, and new road construction). These findings highlight the potential of the proposed MARL method for large-scale multi-modal transportation network analysis, particularly under various incident scenarios, providing an effective tool for urban transportation planning and project evaluation.
城市化和交通方式的扩张加剧了理解旅行者在不同交通方式下的路线选择决策过程的挑战。本文提出了一种基于多智能体强化学习(MARL)的宏观混合序列博弈方法,以解决多式联运网络仿真中的计算效率和行为复杂性问题。具体而言,将智能体的感知行为建模为考虑道路容量约束的顺序决策过程,有助于在多模式交通分配中估计拥堵效应下的出行时间。此外,提出了一种混合奖励框架,提供系统级奖励,引导多智能体系统走向不同的纳什均衡,从而减少策略波动。为了模拟不同交通方式智能体之间的交互作用,采用针对汽车、公交、优先公交和地铁等交通方式设计的多边缘表示和奖励结构来处理通过同一道路的混合交通流。此外,我们的方法使用平均场多智能体深度q -学习方法来考虑模式和路径选择,通过平均场理论和具有相同起点-目的地(OD)需求的聚类智能体简化智能体交互。实验结果表明,混合顺序反馈策略在收敛速度、智能体奖励分配和网络流量分配方面都优于同步反馈策略。并在苏-福尔斯网络上进行了测试,验证了该方法在三种网络变化场景(中断、道路重建和新建道路)下的计算效率。这些发现突出了提出的MARL方法在大规模多式联运网络分析中的潜力,特别是在各种事件情景下,为城市交通规划和项目评估提供了有效的工具。
{"title":"Multi-agent reinforcement learning with a hybrid sequential reward feedback strategy for dynamic multi-modal traffic assignment","authors":"Dongyue Cun ,&nbsp;Muqing Du ,&nbsp;Lin Cheng ,&nbsp;Anthony Chen","doi":"10.1016/j.trc.2026.105545","DOIUrl":"10.1016/j.trc.2026.105545","url":null,"abstract":"<div><div>Urbanization and the expansion of transportation modes have exacerbated the challenges of understanding travelers’ decision-making processes regarding route choice across various transportation modes. This paper proposes a novel macroscopic hybrid sequential game method using multi-agent reinforcement learning (MARL) to address issues of computational efficiency and behavioral complexity in multi-modal transportation network simulations. Specifically, agents’ perception behaviors are modeled as a sequential decision-making process considering road capacity constraints, which helps estimate travel time under congestion effects in the multi-modal traffic assignment. In addition, a hybrid reward framework is proposed, providing system-level reward to guide the multi-agent system towards different Nash equilibria, thereby reducing policy fluctuations. To simulate interactions between agents of different transportation modes, a multi-edge representation and reward structures designed for car, bus, priority bus, and metro modes are adopted to handle the mixed traffic flow through the same road. Furthermore, our approach uses a mean-field multi-agent deep Q-learning method to consider both mode and route choice, simplifying agent interactions through mean-field theory and clustering agents with the same origin–destination (OD) demands. Experimental results demonstrate that the hybrid sequential feedback strategy outperforms the simultaneous feedback strategy regarding convergence speed, agent reward distribution, and network flow distribution. Furthermore, the proposed method is tested on the Sioux-Falls network to verify its computational efficiency in three network change scenarios (disruption, road reconstruction, and new road construction). These findings highlight the potential of the proposed MARL method for large-scale multi-modal transportation network analysis, particularly under various incident scenarios, providing an effective tool for urban transportation planning and project evaluation.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"185 ","pages":"Article 105545"},"PeriodicalIF":7.6,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146102562","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
Real-time identification of cooperative perception necessity in road traffic scenarios 道路交通场景中协同感知必要性的实时识别
IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-03 DOI: 10.1016/j.trc.2026.105547
Chengyuan Ma , Hangyu Li , Keke Long , Hang Zhou , Zhaohui Liang , Pei Li , Hongkai Yu , Xiaopeng Li
Cooperative perception (CP) has shown great potential in enhancing traffic safety with Vehicle-to-Everything (V2X) communications. However, its substantial communication burden makes resource-efficient CP crucial, especially when a single vehicle’s intelligence with adequate perception is sufficient to handle most traffic scenarios. Therefore, to reduce the resource consumption of CP, it is essential to identify the traffic conditions under which CP should be applied. This paper addresses this issue by identifying the necessity of CP among road users, and evaluating whether their sensory information is adequate for ensuring traffic safety. We propose a practical framework to assess CP necessity by leveraging bird’s-eye view data from roadside cameras. The framework begins with video-based object localization and tracking to identify the position and movement of each road user. Next, we use a stochastic motion prediction model to analyze the collision risks between pairs of road users. Simultaneously, pairwise perception analysis is used to assess the probability of one road user perceiving another, determining if a road user falls within a blind spot. Road users with both collision risk and potential perception blind spots are identified as requiring CP. Field tests are conducted using real-world scenarios at two complex intersections in Madison, WI, which include a diverse range of road users, such as various vehicles and vulnerable pedestrians and cyclists. The results demonstrate that the proposed framework can effectively identify the safety-challenging scenarios that require CP in complex traffic environments. With only 0.1% of situations in our field test requiring CP, implementing the proposed framework can save a significant amount of communication bandwidth and computational costs while ensuring the same level of safety. Our code and data will be made available upon the acceptance of this paper.
协同感知(CP)在车辆与万物(V2X)通信中显示出巨大的潜力,可以提高交通安全。然而,其巨大的通信负担使得资源高效的CP至关重要,特别是当单个车辆具有足够感知能力的智能足以处理大多数交通场景时。因此,为了减少CP的资源消耗,确定应用CP的交通条件是至关重要的。本文通过识别道路使用者CP的必要性,并评估他们的感官信息是否足以确保交通安全来解决这个问题。我们提出了一个实用的框架,通过利用路边摄像头的鸟瞰数据来评估CP的必要性。该框架从基于视频的对象定位和跟踪开始,以识别每个道路使用者的位置和运动。接下来,我们使用随机运动预测模型来分析道路使用者对之间的碰撞风险。同时,两两感知分析用于评估一个道路使用者感知另一个道路使用者的概率,确定道路使用者是否处于盲点内。同时存在碰撞风险和潜在感知盲点的道路使用者被确定为需要CP。在威斯康辛州麦迪逊的两个复杂十字路口,使用真实场景进行了现场测试,其中包括各种各样的道路使用者,如各种车辆、脆弱的行人和骑自行车的人。结果表明,该框架能够有效识别复杂交通环境中需要CP的安全挑战场景。在我们的现场测试中,只有0.1%的情况需要CP,实施提议的框架可以节省大量的通信带宽和计算成本,同时确保相同的安全水平。我们的代码和数据将在本文被接受后提供。
{"title":"Real-time identification of cooperative perception necessity in road traffic scenarios","authors":"Chengyuan Ma ,&nbsp;Hangyu Li ,&nbsp;Keke Long ,&nbsp;Hang Zhou ,&nbsp;Zhaohui Liang ,&nbsp;Pei Li ,&nbsp;Hongkai Yu ,&nbsp;Xiaopeng Li","doi":"10.1016/j.trc.2026.105547","DOIUrl":"10.1016/j.trc.2026.105547","url":null,"abstract":"<div><div>Cooperative perception (CP) has shown great potential in enhancing traffic safety with Vehicle-to-Everything (V2X) communications. However, its substantial communication burden makes resource-efficient CP crucial, especially when a single vehicle’s intelligence with adequate perception is sufficient to handle most traffic scenarios. Therefore, to reduce the resource consumption of CP, it is essential to identify the traffic conditions under which CP should be applied. This paper addresses this issue by identifying the necessity of CP among road users, and evaluating whether their sensory information is adequate for ensuring traffic safety. We propose a practical framework to assess CP necessity by leveraging bird’s-eye view data from roadside cameras. The framework begins with video-based object localization and tracking to identify the position and movement of each road user. Next, we use a stochastic motion prediction model to analyze the collision risks between pairs of road users. Simultaneously, pairwise perception analysis is used to assess the probability of one road user perceiving another, determining if a road user falls within a blind spot. Road users with both collision risk and potential perception blind spots are identified as requiring CP. Field tests are conducted using real-world scenarios at two complex intersections in Madison, WI, which include a diverse range of road users, such as various vehicles and vulnerable pedestrians and cyclists. The results demonstrate that the proposed framework can effectively identify the safety-challenging scenarios that require CP in complex traffic environments. With only 0.1% of situations in our field test requiring CP, implementing the proposed framework can save a significant amount of communication bandwidth and computational costs while ensuring the same level of safety. Our code and data will be made available upon the acceptance of this paper.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"185 ","pages":"Article 105547"},"PeriodicalIF":7.6,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146102561","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 “A line planning approach with passenger assignment considering cross-line operations and flexible train composition for a metro network” [Transp. Res. Part C: Emerg. Technol. 183 (2026) 105489] “考虑地铁网络跨线运营和灵活列车组成的乘客分配的线路规划方法”的勘误表。C部分:紧急情况科技。183 (2026)105489]
IF 8.3 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-02 DOI: 10.1016/j.trc.2026.105544
Zhikai Wang, Andrea D’Ariano, Shuai Su, Tao Tang, Boyi Su
{"title":"Corrigendum to “A line planning approach with passenger assignment considering cross-line operations and flexible train composition for a metro network” [Transp. Res. Part C: Emerg. Technol. 183 (2026) 105489]","authors":"Zhikai Wang, Andrea D’Ariano, Shuai Su, Tao Tang, Boyi Su","doi":"10.1016/j.trc.2026.105544","DOIUrl":"https://doi.org/10.1016/j.trc.2026.105544","url":null,"abstract":"","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"39 1","pages":""},"PeriodicalIF":8.3,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146110848","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
Vertical federated learning for transport mode detection using multi-modality data 使用多模态数据进行传输模式检测的垂直联合学习
IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-01 DOI: 10.1016/j.trc.2026.105546
Ningkang Yang , Ramandeep Singh , Oleksandr Shtykalo , Iuliia Yamnenko , Constantinos Antoniou
Transport mode detection (TMD) is vital for intelligent transportation systems and urban computing. However, most existing approaches rely on data from a single modality, such as GPS trajectories or inertial measurement units. This limits their effectiveness in dynamic real-world scenarios. While some studies have improved transport mode detection by combining multiple modalities, heterogeneities in sampling frequency, spatial precision, signal coverage, and occasional missing-modality conditions, together with the requirement for strict temporal alignment, constrain the fused data to the resolution of the weakest modality and lead to substantial information loss. Furthermore, centralizing data from all modalities is often impractical, as the different data types are held by separate parties that may lack labeled data and may also be unwilling to share their raw data due to privacy or commercial concerns. To address these issues, we propose a semi-supervised vertical federated learning (VFL) framework for TMD that uses IMU, GPS, and mobile phone network data. In this framework, each party independently trains an attention-based autoencoder to encode local features. The hidden features are then sent to a central server for classification, and the classification loss is propagated back for local model updating. Given the high-frequency nature of IMU data, we have designed a dynamic sub-segment sampling strategy to adapt to transport mode detection tasks with different temporal resolutions. In addition, the framework adopts distillation and representation alignment to mitigate the impact of missing or weak modalities, and it supports both single-modality and multi-modality inference. We compared the proposed model with several state-of-the-art models, exploring the effectiveness of the different components of the VFL framework. The results demonstrate that our model consistently outperforms multiple baselines, and the proposed VFL framework effectively enhances local inference performance, which can be extended to various model architectures.
交通模式检测(TMD)对于智能交通系统和城市计算至关重要。然而,大多数现有方法依赖于来自单一模态的数据,例如GPS轨迹或惯性测量单元。这限制了它们在动态现实场景中的有效性。虽然一些研究通过结合多模态来改进传输模态检测,但采样频率、空间精度、信号覆盖和偶尔缺失模态条件的异质性,以及对严格的时间对准的要求,将融合数据限制在最弱模态的分辨率上,导致大量信息丢失。此外,集中来自所有模式的数据通常是不切实际的,因为不同的数据类型由不同的各方持有,这些各方可能缺乏标记数据,并且由于隐私或商业考虑,也可能不愿意共享其原始数据。为了解决这些问题,我们为TMD提出了一个半监督的垂直联邦学习(VFL)框架,该框架使用IMU、GPS和移动电话网络数据。在这个框架中,每一方都独立地训练一个基于注意力的自编码器来编码局部特征。然后将隐藏的特征发送到中央服务器进行分类,并将分类损失传播回来用于本地模型更新。考虑到IMU数据的高频特性,我们设计了一种动态子段采样策略来适应不同时间分辨率的传输模式检测任务。此外,该框架采用蒸馏和表示对齐来减轻缺失或弱模态的影响,并支持单模态和多模态推理。我们将提出的模型与几个最先进的模型进行了比较,探讨了VFL框架不同组成部分的有效性。结果表明,我们的模型优于多个基线,所提出的VFL框架有效地提高了局部推理性能,可以扩展到各种模型体系结构。
{"title":"Vertical federated learning for transport mode detection using multi-modality data","authors":"Ningkang Yang ,&nbsp;Ramandeep Singh ,&nbsp;Oleksandr Shtykalo ,&nbsp;Iuliia Yamnenko ,&nbsp;Constantinos Antoniou","doi":"10.1016/j.trc.2026.105546","DOIUrl":"10.1016/j.trc.2026.105546","url":null,"abstract":"<div><div>Transport mode detection (TMD) is vital for intelligent transportation systems and urban computing. However, most existing approaches rely on data from a single modality, such as GPS trajectories or inertial measurement units. This limits their effectiveness in dynamic real-world scenarios. While some studies have improved transport mode detection by combining multiple modalities, heterogeneities in sampling frequency, spatial precision, signal coverage, and occasional missing-modality conditions, together with the requirement for strict temporal alignment, constrain the fused data to the resolution of the weakest modality and lead to substantial information loss. Furthermore, centralizing data from all modalities is often impractical, as the different data types are held by separate parties that may lack labeled data and may also be unwilling to share their raw data due to privacy or commercial concerns. To address these issues, we propose a semi-supervised vertical federated learning (VFL) framework for TMD that uses IMU, GPS, and mobile phone network data. In this framework, each party independently trains an attention-based autoencoder to encode local features. The hidden features are then sent to a central server for classification, and the classification loss is propagated back for local model updating. Given the high-frequency nature of IMU data, we have designed a dynamic sub-segment sampling strategy to adapt to transport mode detection tasks with different temporal resolutions. In addition, the framework adopts distillation and representation alignment to mitigate the impact of missing or weak modalities, and it supports both single-modality and multi-modality inference. We compared the proposed model with several state-of-the-art models, exploring the effectiveness of the different components of the VFL framework. The results demonstrate that our model consistently outperforms multiple baselines, and the proposed VFL framework effectively enhances local inference performance, which can be extended to various model architectures.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"184 ","pages":"Article 105546"},"PeriodicalIF":7.6,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146095873","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 “The VCG pricing policy with unit reserve prices for ride-sourcing is 34-incentive compatibility” [Transp. Res. Part C: Emerg. Technol. 171 (2025) 104991] “以单位保留价格为乘车资源的VCG定价政策是34 -激励兼容”的勘误表[运输。C部分:紧急情况科技。171 (2025)104991]
IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Pub Date : 2026-02-01 DOI: 10.1016/j.trc.2026.105543
Ruijie Li , Haiyuan Chen , Xiaobo Liu , Kenan Zhang
{"title":"Corrigendum to “The VCG pricing policy with unit reserve prices for ride-sourcing is 34-incentive compatibility” [Transp. Res. Part C: Emerg. Technol. 171 (2025) 104991]","authors":"Ruijie Li ,&nbsp;Haiyuan Chen ,&nbsp;Xiaobo Liu ,&nbsp;Kenan Zhang","doi":"10.1016/j.trc.2026.105543","DOIUrl":"10.1016/j.trc.2026.105543","url":null,"abstract":"","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"184 ","pages":"Article 105543"},"PeriodicalIF":7.6,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146110264","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 C-Emerging Technologies
全部 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