Transportation Research Part B-Methodological最新文献_第7页

Railway deregulation in the west and east: The impacts of organizational structure patterns on air-HSRs competition 东西部铁路放松管制：组织结构模式对空高铁竞争的影响

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-09-08 DOI: 10.1016/j.trb.2025.103304

Yixiao Wang , Kun Wang , Eric Pels , Jianhong Wu

In the context of railway deregulation in the West and East, introducing competition (through open access) to railways can be achieved via different organizational structures. Using game theoretic method, this is the first attempt to model three organizational structures, namely, full separation, holding, and full integration, and to investigate their impacts on air-HSRs competition. Analytically and numerically (based on the Beijing-Shanghai route), for a profit-oriented HSR infrastructure, a holding structure helps HSR to compete most effectively with air, delivering the highest profits for the HSR competitor and the HSR industry. Compared with other structures, a full integration structure produces the highest market share for the HSR incumbent and HSR consumer surplus, resulting in predatory pricing against the HSR competitor. Moreover, integration leads to strong economic incentives for the incumbent to implement limit pricing to dislodge entry. These results provide an elucidation for the puzzle of why railway deregulation in the Chinese market has lagged compared with that in Europe. Further sensitivity analysis shows that the regulation of the access charging regime has an effect on the impact of the organizational structure in which a welfare-oriented regulation should be coupled with a profit-oriented structure such as full separation. In general, each structure has pros and cons, and different authority goals (promote modal shift, increase competition, improve welfare, etc.) and statuses serve as a prerequisite for choosing the optimal structure.

在西方和东方放松铁路管制的背景下，引入竞争（通过开放获取）铁路可以通过不同的组织结构来实现。本文首次运用博弈论方法，对完全分离、控股和完全整合三种组织结构进行建模，并考察其对航空高铁竞争的影响。从分析和数字上（基于京沪高铁）来看，对于以利润为导向的高铁基础设施，控股结构有助于高铁最有效地与航空竞争，为高铁竞争对手和高铁行业带来最高的利润。与其他结构相比，完全一体化结构为高铁在位者带来了最高的市场份额和高铁消费者剩余，从而导致对高铁竞争对手的掠夺性定价。此外，一体化还会产生强大的经济激励，促使现有企业实施限价以驱逐进入者。这些结果解释了为什么中国市场的铁路放松管制落后于欧洲的困惑。进一步的敏感性分析表明，在以福利为导向的监管应与以利润为导向的结构（如完全分离）相结合的情况下，准入收费制度的监管对组织结构的影响有影响。一般来说，每种结构都有利弊，不同的权威目标（促进模式转变、增加竞争、提高福利等）和地位是选择最优结构的前提。

{"title":"Railway deregulation in the west and east: The impacts of organizational structure patterns on air-HSRs competition","authors":"Yixiao Wang , Kun Wang , Eric Pels , Jianhong Wu","doi":"10.1016/j.trb.2025.103304","DOIUrl":"10.1016/j.trb.2025.103304","url":null,"abstract":"<div><div>In the context of railway deregulation in the West and East, introducing competition (through open access) to railways can be achieved via different organizational structures. Using game theoretic method, this is the first attempt to model three organizational structures, namely, full separation, holding, and full integration, and to investigate their impacts on air-HSRs competition. Analytically and numerically (based on the Beijing-Shanghai route), for a profit-oriented HSR infrastructure, a holding structure helps HSR to compete most effectively with air, delivering the highest profits for the HSR competitor and the HSR industry. Compared with other structures, a full integration structure produces the highest market share for the HSR incumbent and HSR consumer surplus, resulting in predatory pricing against the HSR competitor. Moreover, integration leads to strong economic incentives for the incumbent to implement limit pricing to dislodge entry. These results provide an elucidation for the puzzle of why railway deregulation in the Chinese market has lagged compared with that in Europe. Further sensitivity analysis shows that the regulation of the access charging regime has an effect on the impact of the organizational structure in which a welfare-oriented regulation should be coupled with a profit-oriented structure such as full separation. In general, each structure has pros and cons, and different authority goals (promote modal shift, increase competition, improve welfare, etc.) and statuses serve as a prerequisite for choosing the optimal structure.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103304"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145010650","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

Exact solution method for multi-stakeholder freight transportation systems under uncertainty 不确定条件下多利益相关者货运系统的精确解方法

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-09-01 DOI: 10.1016/j.trb.2025.103288

Gita Taherkhani , Mojtaba Hosseini , Ali Hassanzadeh

At a time where efficient freight logistics are crucial to global commerce, integrated multi-stakeholder freight transportation systems play a pivotal role in ensuring timely delivery and operational adaptability under uncertainty. This study focuses on the tactical planning of such a system, which processes time-sensitive requests from both carriers and shippers. It orchestrates operations spatially and temporally, combining loads from various shippers into unified transport units. Our approach utilizes a two-stage stochastic programming model that effectively captures the uncertainties inherent in demand. The model formulates an efficient service network that not only meets the immediate logistical demands but also adapts to fluctuating conditions by leveraging available service capacities. To solve this complex model, we develop and implement an exact Benders decomposition-based algorithm. Our solution methodology incorporates several advanced techniques including partial decomposition, cut-lifting for both optimality and feasibility cuts, and various preprocessing steps including variable fixing and the use of valid inequalities. Additionally, we implement acceleration techniques that capitalize on the repetitive nature of our algorithm to enhance efficiency. We design and generate test instances inspired by real-world freight logistics, capturing key operational constraints and varying demand uncertainty levels. These instances enable a systematic evaluation of our model under diverse settings. We then perform extensive computational experiments. Our solution methodology demonstrates superior performance compared to a commercial solver. We also explore the impact of varying service availability among other parameters and the benefits of using stochastic modeling over deterministic approaches. These experiments underscore our model’s capacity to improve operational efficacy and responsiveness when dealing with uncertainty, thereby providing significant insights for both practitioners and researchers involved in freight logistics.

在高效的货运物流对全球商业至关重要的时代，综合的多利益相关者货运系统在确保及时交付和不确定性下的运营适应性方面发挥着关键作用。本研究的重点是这样一个系统的战术规划，该系统处理来自承运人和托运人的时间敏感请求。它在空间和时间上协调操作，将来自不同托运人的货物组合成统一的运输单元。我们的方法利用了一个两阶段的随机规划模型，有效地捕获了需求中固有的不确定性。该模型制定了一个高效的服务网络，不仅满足即时的后勤需求，而且通过利用现有的服务能力来适应波动的条件。为了解决这个复杂的模型，我们开发并实现了一个精确的基于Benders分解的算法。我们的解决方法结合了几种先进的技术，包括部分分解，最优性和可行性切割的切割提升，以及各种预处理步骤，包括变量固定和有效不等式的使用。此外，我们实现了加速技术，利用我们算法的重复特性来提高效率。我们设计和生成受现实世界货运物流启发的测试实例，捕捉关键的操作约束和不同的需求不确定性水平。这些实例能够在不同的设置下对我们的模型进行系统的评估。然后我们进行了大量的计算实验。与商业求解器相比，我们的求解方法表现出优越的性能。我们还探讨了不同服务可用性对其他参数的影响，以及使用随机建模优于确定性方法的好处。这些实验强调了我们的模型在处理不确定性时提高操作效率和响应能力的能力，从而为涉及货运物流的从业者和研究人员提供了重要的见解。

{"title":"Exact solution method for multi-stakeholder freight transportation systems under uncertainty","authors":"Gita Taherkhani , Mojtaba Hosseini , Ali Hassanzadeh","doi":"10.1016/j.trb.2025.103288","DOIUrl":"10.1016/j.trb.2025.103288","url":null,"abstract":"<div><div>At a time where efficient freight logistics are crucial to global commerce, integrated multi-stakeholder freight transportation systems play a pivotal role in ensuring timely delivery and operational adaptability under uncertainty. This study focuses on the tactical planning of such a system, which processes time-sensitive requests from both carriers and shippers. It orchestrates operations spatially and temporally, combining loads from various shippers into unified transport units. Our approach utilizes a two-stage stochastic programming model that effectively captures the uncertainties inherent in demand. The model formulates an efficient service network that not only meets the immediate logistical demands but also adapts to fluctuating conditions by leveraging available service capacities. To solve this complex model, we develop and implement an exact Benders decomposition-based algorithm. Our solution methodology incorporates several advanced techniques including partial decomposition, cut-lifting for both optimality and feasibility cuts, and various preprocessing steps including variable fixing and the use of valid inequalities. Additionally, we implement acceleration techniques that capitalize on the repetitive nature of our algorithm to enhance efficiency. We design and generate test instances inspired by real-world freight logistics, capturing key operational constraints and varying demand uncertainty levels. These instances enable a systematic evaluation of our model under diverse settings. We then perform extensive computational experiments. Our solution methodology demonstrates superior performance compared to a commercial solver. We also explore the impact of varying service availability among other parameters and the benefits of using stochastic modeling over deterministic approaches. These experiments underscore our model’s capacity to improve operational efficacy and responsiveness when dealing with uncertainty, thereby providing significant insights for both practitioners and researchers involved in freight logistics.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103288"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144922205","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 multitrait-multimethod model linking consumers’ priorities and preferences in public transport usage 一个连接消费者在公共交通使用中的优先事项和偏好的多特征-多方法模型

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-09-05 DOI: 10.1016/j.trb.2025.103307

Thomas J. Magor, Leonard V. Coote

The interrelatedness of stated choice and best worst experiments motivates the core question of the current research; that is, does a shared behavioural process given rise to responses to both preference elicitation methods. The basic premise of the paper is that a common, underlying behavioural process gives rise to the responses of decision makers to both preference elicitation methods; and therefore, the patterns of preference heterogeneity between both methods can be mapped. We investigate this using a multitrait-multimethod specification of mixed logit which has the following two defining characteristics: firstly, the partitioning of the unobserved sources of preference heterogeneity into components that are general to the methods and second, components that are unique to each method. The core findings show that common underlying sources of preference heterogeneity do give rise to decision makers’ responses in both stated choice and best worst experiments (following a specifically theorised stucture). Our primary empirical contribution is – for within subjects deigns where data is generated from the same respondents across two or more preference elicitation methods – that the preference heterogeneity for alike attributes in each of the elicitation methods can be empirically shown to converge on the same source. This remains an assumption in much prior research of this type, but until now, method effects related to the use of different preference elicitation tasks have confounded the interpretation of jointly estimated models that combined attribute priorities and preferences. The implications of our work for transport researchers is that best worst and stated choice experiments can be used in complementary ways – given the empirical support for this core assumption.

陈述选择和最佳最差实验的相互关系激发了当前研究的核心问题；也就是说，一个共同的行为过程是否会引起对两种偏好诱导方法的反应。本文的基本前提是，一个共同的、潜在的行为过程导致决策者对两种偏好激发方法的反应；因此，可以映射两种方法之间的偏好异质性模式。我们使用混合logit的多性状-多方法规范来研究这一点，该规范具有以下两个定义特征：首先，将未观察到的偏好异质性来源划分为方法的一般成分，其次，每种方法的独特成分。核心发现表明，偏好异质性的共同潜在来源确实会引起决策者在陈述选择和最佳最差实验中的反应（遵循特定的理论结构）。我们的主要经验贡献是-在受试者设计中，数据是通过两种或多种偏好引出方法从相同的受访者中生成的-每种引出方法中相似属性的偏好异质性可以在经验上显示为收敛于同一来源。这仍然是这类先前研究的一个假设，但到目前为止，与使用不同偏好激发任务相关的方法效应已经混淆了结合属性优先级和偏好的联合估计模型的解释。我们的工作对交通研究人员的启示是，考虑到对这一核心假设的经验支持，最佳最差选择实验和陈述选择实验可以以互补的方式使用。

{"title":"A multitrait-multimethod model linking consumers’ priorities and preferences in public transport usage","authors":"Thomas J. Magor, Leonard V. Coote","doi":"10.1016/j.trb.2025.103307","DOIUrl":"10.1016/j.trb.2025.103307","url":null,"abstract":"<div><div>The interrelatedness of stated choice and best worst experiments motivates the core question of the current research; that is, does a shared behavioural process given rise to responses to both preference elicitation methods. The basic premise of the paper is that a common, underlying behavioural process gives rise to the responses of decision makers to both preference elicitation methods; and therefore, the patterns of preference heterogeneity between both methods can be mapped. We investigate this using a multitrait-multimethod specification of mixed logit which has the following two defining characteristics: firstly, the partitioning of the unobserved sources of preference heterogeneity into components that are general to the methods and second, components that are unique to each method. The core findings show that common underlying sources of preference heterogeneity do give rise to decision makers’ responses in both stated choice and best worst experiments (following a specifically theorised stucture). Our primary empirical contribution is – for within subjects deigns where data is generated from the same respondents across two or more preference elicitation methods – that the preference heterogeneity for alike attributes in each of the elicitation methods can be empirically shown to converge on the same source. This remains an assumption in much prior research of this type, but until now, method effects related to the use of different preference elicitation tasks have confounded the interpretation of jointly estimated models that combined attribute priorities and preferences. The implications of our work for transport researchers is that best worst and stated choice experiments can be used in complementary ways – given the empirical support for this core assumption.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103307"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144996549","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

Comparison of compact formulations for the electric vehicle routing problem 电动汽车路径问题紧凑公式的比较

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-09-09 DOI: 10.1016/j.trb.2025.103314

Zhiguo Wu , Hande Yaman

The electric vehicle routing problem is an extension of the capacitated vehicle routing problem, where en-route recharging needs to be addressed due to the limited driving range of electric vehicles. In this study, we compare four compact formulations that differ in the way they model the battery consumption. The first two formulations use Miller–Tucker–Zemlin’s approach, while the last two use single-commodity flows for this purpose. Within each approach, the two formulations have distinct ways of dealing with the fact that recharging stations may be visited more than once. In particular, two formulations make use of arcs that correspond to two-leg paths with a recharging station in the middle, whereas the other two formulations use copies of recharging stations, as suggested in the literature. We compare the linear programming bounds of these four formulations as well as the existing formulations from a theoretical point of view. Then, we analyze the performance of the new and existing formulations using six sets of benchmark instances. The computational results show that our formulations tighten the linear programming bounds and require less computation time to prove optimality.

电动汽车路径问题是有容车辆路径问题的延伸，由于电动汽车行驶里程有限，需要解决途中充电问题。在这项研究中，我们比较了四种紧凑的配方，不同的方式，他们模拟电池消耗。前两个公式使用米勒-塔克-泽姆林的方法，而最后两个公式使用单一商品流来实现这一目的。在每一种方法中，这两种方案都有不同的方法来处理充电站可能被访问不止一次的事实。特别地，两种配方使用了两条腿路径对应的弧线，中间有一个充电站，而其他两种配方使用了充电站的副本，如文献中所建议的。我们从理论上比较了这四种表述的线性规划界以及现有表述的线性规划界。然后，我们使用六组基准实例分析了新公式和现有公式的性能。计算结果表明，我们的公式收紧了线性规划边界，证明最优性所需的计算时间较少。

{"title":"Comparison of compact formulations for the electric vehicle routing problem","authors":"Zhiguo Wu , Hande Yaman","doi":"10.1016/j.trb.2025.103314","DOIUrl":"10.1016/j.trb.2025.103314","url":null,"abstract":"<div><div>The electric vehicle routing problem is an extension of the capacitated vehicle routing problem, where en-route recharging needs to be addressed due to the limited driving range of electric vehicles. In this study, we compare four compact formulations that differ in the way they model the battery consumption. The first two formulations use Miller–Tucker–Zemlin’s approach, while the last two use single-commodity flows for this purpose. Within each approach, the two formulations have distinct ways of dealing with the fact that recharging stations may be visited more than once. In particular, two formulations make use of arcs that correspond to two-leg paths with a recharging station in the middle, whereas the other two formulations use copies of recharging stations, as suggested in the literature. We compare the linear programming bounds of these four formulations as well as the existing formulations from a theoretical point of view. Then, we analyze the performance of the new and existing formulations using six sets of benchmark instances. The computational results show that our formulations tighten the linear programming bounds and require less computation time to prove optimality.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103314"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145019578","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

Choice-driven bilevel optimization for multiclass traffic congestion management via eco-routing incentives 基于生态路径激励的多级交通拥堵管理的选择驱动双层优化

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-08-29 DOI: 10.1016/j.trb.2025.103289

Mingye Luan , Taha Hossein Rashidi , S. Travis Waller , David Rey

This study contributes to sustainable transportation modeling by proposing a user-centric approach to incentivize eco-routing travel behavior. We propose a novel reward credit scheme to provide path-based commuter incentives with the goal of reducing

C O_{2}

emissions and the total system travel time. The scheme takes into account multiple classes of commuters in the network that differ by their value of time and their vehicle energy type. Users subscribing to the scheme may earn monetary reward credits which act as incentives to promote sustainable mobility. Two types of reward credits are considered: subscription- and path-based credits. A discrete choice model is embedded within a traffic assignment model to capture the endogenous impact of commuters’ scheme adoption onto network congestion effects. We introduce a bilevel optimization formulation to determine optimal non-additive, path-based reward credits and subscription-based reward credits within a predefined budget under traffic equilibrium conditions. In this formulation, the follower problem is a parameterized multi-class user equilibrium traffic assignment problem with non-additive path costs and incorporates a logit choice model for scheme adoption. The leader represent the network regulator whose goal is to maximize social welfare by minimizing the total system travel time and total

C O_{2}

emissions. We develop a single-level Karush–Kuhn–Tucker reformulation and propose a customized branch-and-bound algorithm to solve this bilevel optimization problem. Numerical experiments demonstrate the potential of eco-routing incentives to promote sustainable urban mobility and highlight the benefits of combining subscription- and path-based reward credits for traffic congestion management.

本研究通过提出以用户为中心的方法来激励生态路线出行行为，为可持续交通建模做出了贡献。我们提出了一种新的奖励积分方案，以减少二氧化碳排放和系统总旅行时间为目标，提供基于路径的通勤激励。该方案考虑了网络中不同类型的通勤者，他们的时间价值和车辆能量类型不同。订阅该计划的用户可获得货币奖励积分，作为促进可持续交通的激励措施。我们考虑了两种类型的奖励积分：订阅积分和基于路径的积分。在交通分配模型中嵌入离散选择模型，以捕捉通勤者方案采用对网络拥塞效应的内生影响。我们引入了一个双层优化公式，以确定最优的非加性，基于路径的奖励积分和基于订阅的奖励积分在预定义的预算在交通平衡条件下。在该公式中，follower问题是一个具有非加性路径成本的参数化多类用户均衡流量分配问题，并引入了一个logit选择模型用于方案的采用。领导者代表网络监管者，其目标是通过最小化系统总运行时间和总二氧化碳排放量来最大化社会福利。我们发展了一个单层次的Karush-Kuhn-Tucker重构，并提出了一个定制的分支定界算法来解决这个双层优化问题。数值实验证明了生态路线激励在促进可持续城市交通方面的潜力，并强调了将订阅和基于路径的奖励积分结合起来用于交通拥堵管理的好处。

{"title":"Choice-driven bilevel optimization for multiclass traffic congestion management via eco-routing incentives","authors":"Mingye Luan , Taha Hossein Rashidi , S. Travis Waller , David Rey","doi":"10.1016/j.trb.2025.103289","DOIUrl":"10.1016/j.trb.2025.103289","url":null,"abstract":"<div><div>This study contributes to sustainable transportation modeling by proposing a user-centric approach to incentivize eco-routing travel behavior. We propose a novel reward credit scheme to provide path-based commuter incentives with the goal of reducing <span><math><mrow><mi>C</mi><msub><mrow><mi>O</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></math></span> emissions and the total system travel time. The scheme takes into account multiple classes of commuters in the network that differ by their value of time and their vehicle energy type. Users subscribing to the scheme may earn monetary reward credits which act as incentives to promote sustainable mobility. Two types of reward credits are considered: subscription- and path-based credits. A discrete choice model is embedded within a traffic assignment model to capture the endogenous impact of commuters’ scheme adoption onto network congestion effects. We introduce a bilevel optimization formulation to determine optimal non-additive, path-based reward credits and subscription-based reward credits within a predefined budget under traffic equilibrium conditions. In this formulation, the follower problem is a parameterized multi-class user equilibrium traffic assignment problem with non-additive path costs and incorporates a logit choice model for scheme adoption. The leader represent the network regulator whose goal is to maximize social welfare by minimizing the total system travel time and total <span><math><mrow><mi>C</mi><msub><mrow><mi>O</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></math></span> emissions. We develop a single-level Karush–Kuhn–Tucker reformulation and propose a customized branch-and-bound algorithm to solve this bilevel optimization problem. Numerical experiments demonstrate the potential of eco-routing incentives to promote sustainable urban mobility and highlight the benefits of combining subscription- and path-based reward credits for traffic congestion management.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103289"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144912654","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

Hierarchical bus transit network design in coordination with an existing metro system 与现有地铁系统相协调的分层公交网络设计

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-08-19 DOI: 10.1016/j.trb.2025.103286

Xingrong Wang , David Canca , Ying Lv , Yiwei Zhao , Huijun Sun , Jianjun Wu

The construction of a well-coordinated metro-bus bimodal system may benefit not only passengers performing bimodal trips but also passengers using each individual transit mode. With this aim, this paper focuses on jointly designing a bus network and determining the frequency of bus lines to ensure coordinated operation with an existing metro system. In particular, rather than implementing a single regular line type, a hierarchical bus network structure consisting of different types of bus lines is proposed with the objective of reaching better intermodal coordination. Each line type is characterized by a specific stopping pattern, commercial speed level, and terminal stations. A novel inter-stop distance-based model is proposed to determine the number and the itinerary of the different types of lines and the appropriate bus frequencies so that the total passenger travel time in the bimodal network is minimized under capacity limitations. Meanwhile, a multinomial logit model is incorporated to explicitly capture the endogenous multimodal passenger assignment regarding service level and ticket price. To efficiently solve the hierarchical network design problem, the concept of an improved hierarchical virtual road network is defined. Based on it, a bi-level heuristic decomposition method that breaks down the integrated problem into two simpler subproblems and then solves them iteratively is presented. In addition, the passenger demand information is used internally by the solving procedure in several specialized operators to accelerate the convergence of the algorithm and improve the quality of the solutions. The results of a small-scale case and a real-world network design instance considering three types of lines show that by making a trade-off between lines with different running speeds resulting from different average inter-stop distances, the hierarchical bus network can incentivize commuters into route choices that improve the overall system performance of the integrated metro-bus bimodal network.

一个协调良好的地铁-公交双峰系统的建设不仅可以使双峰出行的乘客受益，也可以使使用每一种交通方式的乘客受益。为此，本文的重点是共同设计公交网络，确定公交线路的频率，以确保与现有地铁系统的协调运行。特别地，为了达到更好的多式联运协调，提出了一种由不同类型的公交线路组成的分层公交网络结构，而不是实施单一的规则线路类型。每条线路都有特定的停车模式、商业速度水平和终点站。提出了一种新的基于站点间距离的模型，以确定不同类型线路的数量和路线以及适当的公交车频率，从而在容量限制下使双峰网络中的总乘客旅行时间最小化。同时，引入多项logit模型，明确地捕捉了内源性多式联运乘客分配与服务水平和票价的关系。为了有效地解决分层网络设计问题，定义了改进的分层虚拟路网的概念。在此基础上，提出了一种双层次启发式分解方法，将集成问题分解为两个更简单的子问题，然后迭代求解。此外，在求解过程中，利用内部的乘客需求信息在多个专门的算子中进行求解，加快了算法的收敛速度，提高了解的质量。考虑三种线路类型的网络设计实例的结果表明，分层公交网络通过在不同平均站间距离的不同运行速度的线路之间进行权衡，可以激励通勤者进行路线选择，从而提高地铁-公交双峰综合网络的整体系统性能。

{"title":"Hierarchical bus transit network design in coordination with an existing metro system","authors":"Xingrong Wang , David Canca , Ying Lv , Yiwei Zhao , Huijun Sun , Jianjun Wu","doi":"10.1016/j.trb.2025.103286","DOIUrl":"10.1016/j.trb.2025.103286","url":null,"abstract":"<div><div>The construction of a well-coordinated metro-bus bimodal system may benefit not only passengers performing bimodal trips but also passengers using each individual transit mode. With this aim, this paper focuses on jointly designing a bus network and determining the frequency of bus lines to ensure coordinated operation with an existing metro system. In particular, rather than implementing a single regular line type, a hierarchical bus network structure consisting of different types of bus lines is proposed with the objective of reaching better intermodal coordination. Each line type is characterized by a specific stopping pattern, commercial speed level, and terminal stations. A novel inter-stop distance-based model is proposed to determine the number and the itinerary of the different types of lines and the appropriate bus frequencies so that the total passenger travel time in the bimodal network is minimized under capacity limitations. Meanwhile, a multinomial logit model is incorporated to explicitly capture the endogenous multimodal passenger assignment regarding service level and ticket price. To efficiently solve the hierarchical network design problem, the concept of an improved hierarchical virtual road network is defined. Based on it, a bi-level heuristic decomposition method that breaks down the integrated problem into two simpler subproblems and then solves them iteratively is presented. In addition, the passenger demand information is used internally by the solving procedure in several specialized operators to accelerate the convergence of the algorithm and improve the quality of the solutions. The results of a small-scale case and a real-world network design instance considering three types of lines show that by making a trade-off between lines with different running speeds resulting from different average inter-stop distances, the hierarchical bus network can incentivize commuters into route choices that improve the overall system performance of the integrated metro-bus bimodal network.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103286"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144864554","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

Solving connected automated vehicle merging problems: A generalized benders decomposition-based approach for mixed-integer nonlinear programming 求解网联自动车辆归并问题：基于广义弯曲分解的混合整数非线性规划方法

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-08-30 DOI: 10.1016/j.trb.2025.103293

Jieming Chen , Yiwei Wu , Yue Zhou , Edward Chung , Shuaian Wang

Intensive interactions among vehicles often lead to congestion and accidents, particularly at freeway merging sections. As connected automated vehicles (CAVs) become a reality, their collaborative driving offers a promising solution. However, the real-time scheduling and trajectory planning for multiple CAV streams remain challenging and are not adequately addressed in the existing literature. To this end, this study formulates an integrated mixed-integer nonlinear programming (MINLP) model to jointly optimize lane change decisions, vehicle sequences, and vehicle trajectories, with the objective of maximizing traffic efficiency and driving comfort at multi-lane freeway merging sections. Existing commercial software struggles to handle such a complicated model. To rapidly obtain solutions, this study designs a Generalized Benders Decomposition (GBD)-based solution algorithm to tackle the problem of multi-vehicle combinatorial optimization and nonlinear trajectory optimization. Meanwhile, the finite convergence property of the GBD approach is proved. Numerical experimental results demonstrate that the proposed model outperforms three benchmark CAV control methods and a two-step method under various traffic demands and mainline-ramp demand ratios, highlighting significant traffic benefits from jointly planning lane changes and driving sequences, as well as utilizing microscopic vehicle information. Furthermore, this study evaluates traffic delay and the number of lane changes under varying road lengths, i.e., the lengths of lane-changing and merging areas, identifying recommended lengths for the maximum traffic efficiency, and analyzing the performance trend under varying traffic demands.

车辆之间的密集互动经常导致拥堵和事故，特别是在高速公路合流路段。随着互联自动驾驶汽车（cav）成为现实，它们的协同驾驶提供了一个很有前景的解决方案。然而，多CAV流的实时调度和轨迹规划仍然具有挑战性，并且在现有文献中没有得到充分的解决。为此，本文建立了一种综合混合整数非线性规划（MINLP）模型，以多车道高速公路合流路段的交通效率和驾驶舒适性最大化为目标，对变道决策、车辆序列和车辆轨迹进行联合优化。现有的商业软件难以处理如此复杂的模型。为了快速求解，本文设计了一种基于广义弯曲分解（GBD）的求解算法来解决多车组合优化和非线性轨迹优化问题。同时，证明了GBD方法的有限收敛性。数值实验结果表明，该模型在不同交通需求和主干道匝道需求比下优于三种基准CAV控制方法和两步控制方法，突出了联合规划变道和行驶顺序以及利用微观车辆信息的显著交通效益。在此基础上，对不同道路长度（即变道区和并合区长度）下的交通延迟和变道次数进行评价，确定最大交通效率的推荐长度，并分析不同交通需求下的性能趋势。

{"title":"Solving connected automated vehicle merging problems: A generalized benders decomposition-based approach for mixed-integer nonlinear programming","authors":"Jieming Chen , Yiwei Wu , Yue Zhou , Edward Chung , Shuaian Wang","doi":"10.1016/j.trb.2025.103293","DOIUrl":"10.1016/j.trb.2025.103293","url":null,"abstract":"<div><div>Intensive interactions among vehicles often lead to congestion and accidents, particularly at freeway merging sections. As connected automated vehicles (CAVs) become a reality, their collaborative driving offers a promising solution. However, the real-time scheduling and trajectory planning for multiple CAV streams remain challenging and are not adequately addressed in the existing literature. To this end, this study formulates an integrated mixed-integer nonlinear programming (MINLP) model to jointly optimize lane change decisions, vehicle sequences, and vehicle trajectories, with the objective of maximizing traffic efficiency and driving comfort at multi-lane freeway merging sections. Existing commercial software struggles to handle such a complicated model. To rapidly obtain solutions, this study designs a Generalized Benders Decomposition (GBD)-based solution algorithm to tackle the problem of multi-vehicle combinatorial optimization and nonlinear trajectory optimization. Meanwhile, the finite convergence property of the GBD approach is proved. Numerical experimental results demonstrate that the proposed model outperforms three benchmark CAV control methods and a two-step method under various traffic demands and mainline-ramp demand ratios, highlighting significant traffic benefits from jointly planning lane changes and driving sequences, as well as utilizing microscopic vehicle information. Furthermore, this study evaluates traffic delay and the number of lane changes under varying road lengths, i.e., the lengths of lane-changing and merging areas, identifying recommended lengths for the maximum traffic efficiency, and analyzing the performance trend under varying traffic demands.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103293"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144920015","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 optimization of train makeup problem and resource scheduling in railway marshalling yards: A hybrid MILP-CP approach with Logic-based Benders decomposition 铁路编组站列车编组问题与资源调度的综合优化：基于逻辑的Benders分解的混合MILP-CP方法

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-09-10 DOI: 10.1016/j.trb.2025.103306

Peiran Han , Lingyun Meng , Xiaojie Luan , Nikola Bešinović , Jianrui Miao , Yihui Wang , Zhengwen Liao

In the marshalling yard, various complex operations occur, leading to inefficiencies in railcar connections. Therefore, designing an effective operational research methodology is essential for the marshalling yard, and even for the local rail freight network. This paper addresses the integrated Train Makeup and Resource Scheduling (TMRS) problem. A Mixed-Integer Linear Programming (MILP) model is developed, where the train makeup problem is formulated as an assignment problem, guiding the overall operations. Additionally, a series of hybrid flow shop scheduling tasks are established to coordinate the operations of trains, blocks, and railcars. Due to the complexity of TMRS, the integrated problem is reformulated as a hybrid mixed-integer linear programming (MILP) and constraint programming (CP) model. Logic-based benders decomposition (LBBD) is used to partition the TMRS problem, with lower bounds designed and integrated into the solving procedure to accelerate the convergence. We propose feasibility cuts, optimality cuts, and symmetry cuts based on the structure of the subproblem, which are dynamically added to the master problem. Two numerical examples are designed to demonstrate the effectiveness of the proposed hybrid modelling approach, lower bounds, and cuts. Finally, the proposed approach and algorithm are tested on a series of artificial instances and real-scale examples, demonstrating their practical effectiveness and ability to achieve high-quality solutions.

在编组站，各种复杂的操作发生，导致铁路车辆连接效率低下。因此，设计一个有效的运筹学研究方法是必不可少的编组站，甚至为当地的铁路货运网络。本文研究了列车组成与资源调度的集成问题。建立了混合整数线性规划（MILP）模型，将列车组成问题转化为分配问题，指导整体运行。此外，还建立了一系列混合流车间调度任务，以协调列车、街区和轨道车辆的运行。考虑到TMRS问题的复杂性，将该问题重新表述为混合整数线性规划（MILP）和约束规划（CP）模型。采用基于逻辑的benders分解（LBBD）对TMRS问题进行划分，并在求解过程中设计下界，以加快收敛速度。提出了基于子问题结构的可行性切割、最优性切割和对称性切割，并将其动态添加到主问题中。设计了两个数值示例来证明所提出的混合建模方法，下界和切割的有效性。最后，通过一系列人工实例和实际算例对所提出的方法和算法进行了测试，验证了其实用性和获得高质量解的能力。

{"title":"Integrated optimization of train makeup problem and resource scheduling in railway marshalling yards: A hybrid MILP-CP approach with Logic-based Benders decomposition","authors":"Peiran Han , Lingyun Meng , Xiaojie Luan , Nikola Bešinović , Jianrui Miao , Yihui Wang , Zhengwen Liao","doi":"10.1016/j.trb.2025.103306","DOIUrl":"10.1016/j.trb.2025.103306","url":null,"abstract":"<div><div>In the marshalling yard, various complex operations occur, leading to inefficiencies in railcar connections. Therefore, designing an effective operational research methodology is essential for the marshalling yard, and even for the local rail freight network. This paper addresses the integrated Train Makeup and Resource Scheduling (TMRS) problem. A Mixed-Integer Linear Programming (MILP) model is developed, where the train makeup problem is formulated as an assignment problem, guiding the overall operations. Additionally, a series of hybrid flow shop scheduling tasks are established to coordinate the operations of trains, blocks, and railcars. Due to the complexity of TMRS, the integrated problem is reformulated as a hybrid mixed-integer linear programming (MILP) and constraint programming (CP) model. Logic-based benders decomposition (LBBD) is used to partition the TMRS problem, with lower bounds designed and integrated into the solving procedure to accelerate the convergence. We propose feasibility cuts, optimality cuts, and symmetry cuts based on the structure of the subproblem, which are dynamically added to the master problem. Two numerical examples are designed to demonstrate the effectiveness of the proposed hybrid modelling approach, lower bounds, and cuts. Finally, the proposed approach and algorithm are tested on a series of artificial instances and real-scale examples, demonstrating their practical effectiveness and ability to achieve high-quality solutions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103306"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145026694","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

C-MP: A decentralized adaptive-coordinated traffic signal control using the Max Pressure framework C-MP：使用最大压力框架的分散自适应协调交通信号控制

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-08-29 DOI: 10.1016/j.trb.2025.103308

Tanveer Ahmed , Hao Liu , Vikash V. Gayah

Coordinated traffic signals seek to provide uninterrupted vehicular flow through a series of closely spaced intersections, typically using pre-defined fixed signal timings and offsets. However, coordination is typically not possible when using adaptive traffic signals that dynamically change signal timings based on observed traffic conditions, particularly in decentralized systems where these decisions are made independently at each intersection. To alleviate this issue, this paper introduces a novel Max Pressure-based traffic signal framework that specifically seeks to provide coordination even under decentralized decision-making. The proposed Coordinated Max Pressure (C-MP) algorithm uses the space mean speeds of vehicles – obtained from detectors or in a connected vehicle (CV) environment – to explicitly detect freely flowing platoons of vehicles and prioritizes their movement along a corridor. Specifically, upstream platoons are detected, and their weight in the MP framework is increased to provide priority, while downstream platoons are detected, and their weight is reduced to ensure smooth traffic flow across corridors. The study analytically proves that C-MP maintains the desirable maximum stability property, while micro-simulation analyses conducted on an arterial network demonstrate its ability to achieve a larger stable region compared to benchmark MP control policies. Simulation results also reveal that the proposed control algorithm can effectively coordinate traffic signals in both directions along an arterial without explicitly assigned offsets or constraints. The results also reveal C-MP's superiority to benchmark coordination strategies in reducing travel time, and fuel consumption both at the corridor level and the network level by balancing the negative impact imparted to vehicles in the minor direction. The proposed algorithm also functions effectively when a subset of vehicles provide input to the controller, as would be the case in a partial CV environment.

协调的交通信号寻求通过一系列紧密间隔的十字路口提供不间断的车辆流量，通常使用预定义的固定信号时间和偏移量。然而，当使用基于观察到的交通状况动态改变信号时间的自适应交通信号时，协调通常是不可能的，特别是在分散的系统中，这些决策是在每个十字路口独立做出的。为了缓解这一问题，本文引入了一种新的基于最大压力的交通信号框架，该框架专门寻求在分散决策下提供协调。提出的协调最大压力（C-MP）算法使用车辆的空间平均速度（从探测器或联网车辆（CV）环境中获得）来明确检测自由流动的车辆排，并优先考虑它们沿着走廊的移动。具体来说，上游排被检测到，并增加其在MP框架中的权重以提供优先权，而下游排被检测到，并减少其权重以确保走廊间的交通畅通。该研究分析证明了C-MP保持了理想的最大稳定性，而在动脉网络上进行的微观模拟分析表明，与基准MP控制策略相比，C-MP能够实现更大的稳定区域。仿真结果还表明，该控制算法可以有效地协调沿主干道方向的交通信号，而无需明确指定偏移量或约束。结果还表明，C-MP通过平衡对次要方向车辆的负面影响，在减少通道级和网络级的旅行时间和燃料消耗方面优于基准协调策略。当车辆子集为控制器提供输入时，所提出的算法也能有效地工作，就像部分CV环境中的情况一样。

{"title":"C-MP: A decentralized adaptive-coordinated traffic signal control using the Max Pressure framework","authors":"Tanveer Ahmed , Hao Liu , Vikash V. Gayah","doi":"10.1016/j.trb.2025.103308","DOIUrl":"10.1016/j.trb.2025.103308","url":null,"abstract":"<div><div>Coordinated traffic signals seek to provide uninterrupted vehicular flow through a series of closely spaced intersections, typically using pre-defined fixed signal timings and offsets. However, coordination is typically not possible when using adaptive traffic signals that dynamically change signal timings based on observed traffic conditions, particularly in decentralized systems where these decisions are made independently at each intersection. To alleviate this issue, this paper introduces a novel Max Pressure-based traffic signal framework that specifically seeks to provide coordination even under decentralized decision-making. The proposed Coordinated Max Pressure (C-MP) algorithm uses the space mean speeds of vehicles – obtained from detectors or in a connected vehicle (CV) environment – to explicitly detect freely flowing platoons of vehicles and prioritizes their movement along a corridor. Specifically, upstream platoons are detected, and their weight in the MP framework is increased to provide priority, while downstream platoons are detected, and their weight is reduced to ensure smooth traffic flow across corridors. The study analytically proves that C-MP maintains the desirable maximum stability property, while micro-simulation analyses conducted on an arterial network demonstrate its ability to achieve a larger stable region compared to benchmark MP control policies. Simulation results also reveal that the proposed control algorithm can effectively coordinate traffic signals in both directions along an arterial without explicitly assigned offsets or constraints. The results also reveal C-MP's superiority to benchmark coordination strategies in reducing travel time, and fuel consumption both at the corridor level and the network level by balancing the negative impact imparted to vehicles in the minor direction. The proposed algorithm also functions effectively when a subset of vehicles provide input to the controller, as would be the case in a partial CV environment.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103308"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144912534","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

Evidence and quantification of cooperation of driving agents in mixed traffic flow 混合交通流中驾驶主体合作的实证与量化

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-08-31 DOI: 10.1016/j.trb.2025.103285

Di Chen , Jia Li , Michael Zhang

Cooperation is a ubiquitous phenomenon in many natural, social, and engineered systems with multiple agents. Understanding the formation of cooperation in mixed traffic is of theoretical interest in its own right, and could also benefit the design and operations of future automated and mixed-autonomy transportation systems. However, how cooperativeness of driving agents can be defined and identified from empirical data seems ambiguous and this hinders further empirical characterizations of the phenomenon and revealing its behavior mechanisms. Towards mitigating this gap, in this paper, we propose a unified conceptual framework to identify collective cooperativeness of driving agents. This framework expands the concept of collective rationality from our recent model (Li et al., 2022), making it empirically identifiable and behaviorally interpretable in realistic (microscopic and dynamic) settings. This framework integrates mixed traffic observations at both microscopic and macroscopic scales to estimate critical behavioral parameters that describe the collective cooperativeness of driving agents. Applying this framework to NGSIM I-80 trajectory data, we empirically confirm the existence of collective cooperation and quantify the condition and likelihood of its emergence. This study provides the first empirical understanding of collective cooperativeness in human-driven mixed traffic and points to new possibilities to manage mixed autonomy traffic systems.

在许多具有多个主体的自然、社会和工程系统中，合作是一种无处不在的现象。理解混合交通中合作的形成本身就具有理论意义，也有利于未来自动化和混合自治交通系统的设计和运营。然而，如何从经验数据中定义和识别驱动主体的合作性似乎是模糊的，这阻碍了对这一现象的进一步经验表征和揭示其行为机制。为了缓解这一差距，在本文中，我们提出了一个统一的概念框架来识别驾驶代理的集体合作。该框架扩展了我们最近模型中的集体理性概念（Li et al., 2022），使其在现实（微观和动态）环境中具有经验可识别性和行为可解释性。该框架整合了微观和宏观尺度上的混合交通观察，以估计描述驾驶主体集体合作的关键行为参数。将这一框架应用于NGSIM I-80轨迹数据，实证证实了集体合作的存在，并量化了集体合作出现的条件和可能性。本研究首次提供了对人类驱动混合交通中的集体合作的实证理解，并指出了管理混合自治交通系统的新可能性。

{"title":"Evidence and quantification of cooperation of driving agents in mixed traffic flow","authors":"Di Chen , Jia Li , Michael Zhang","doi":"10.1016/j.trb.2025.103285","DOIUrl":"10.1016/j.trb.2025.103285","url":null,"abstract":"<div><div>Cooperation is a ubiquitous phenomenon in many natural, social, and engineered systems with multiple agents. Understanding the formation of cooperation in mixed traffic is of theoretical interest in its own right, and could also benefit the design and operations of future automated and mixed-autonomy transportation systems. However, how cooperativeness of driving agents can be defined and identified from empirical data seems ambiguous and this hinders further empirical characterizations of the phenomenon and revealing its behavior mechanisms. Towards mitigating this gap, in this paper, we propose a unified conceptual framework to identify collective cooperativeness of driving agents. This framework expands the concept of collective rationality from our recent model (Li et al., 2022), making it empirically identifiable and behaviorally interpretable in realistic (microscopic and dynamic) settings. This framework integrates mixed traffic observations at both microscopic and macroscopic scales to estimate critical behavioral parameters that describe the collective cooperativeness of driving agents. Applying this framework to NGSIM I-80 trajectory data, we empirically confirm the existence of collective cooperation and quantify the condition and likelihood of its emergence. This study provides the first empirical understanding of collective cooperativeness in human-driven mixed traffic and points to new possibilities to manage mixed autonomy traffic systems.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103285"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144920016","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