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

The multi-commodity flow problem with outsourcing decisions 外包决策中的多商品流问题

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-11-01 Epub Date: 2025-09-30 DOI: 10.1016/j.trb.2025.103333

Elena Fernández , Ivana Ljubić , Nicolás Zerega

We introduce a new prize-collecting problem involving the routing of commodities in a network composed of predefined hub and non-hub nodes. In this setting, the service of non-hub nodes is outsourced to third-party carriers. This study is motivated by the growing prevalence of outsourcing practices in real-world transportation systems, where new entrants or local suppliers increasingly take over parts of the transportation chain – enabling higher volumes and broader network coverage. The problem is modeled as a Stackelberg game: a major firm (the leader) chooses a subset of commodities to serve. The leader aims to outsource the first and last legs of the transportation services to smaller carriers (the followers), assigning at most one carrier to each non-hub node. Each carrier seeks to maximize its own profit, which depends on the offers made by the leader. The goal of the leader is to determine the optimal outsourcing fees, along with the allocation of carriers to the non-hub nodes, so that the profit from the routed commodities is maximized. The optimal response of the followers must be taken into account, as the followers may reject assignments that do not align with their profit-maximizing goals. We also consider two alternative settings: one in which outsourcing fees are fixed, and another where carriers accept any offer yielding non-negative profit. We demonstrate that the set of feasible outsourcing fees can be discretized and formulate the problem as single-level mixed-integer (non)linear program. For all problem variants, we prove NP-hardness and conduct a computational study of various single-level MIP reformulations. Our benchmark instances cover various applications in transportation, such as air transportation, postal delivery and freight transportation. We assess the scalability of proposed formulations and analyze the impact of different carrier reservation prices on solution quality. Finally, by comparing the alternative problem settings, we extract valuable managerial insights.

我们引入了一个新的奖品收集问题，该问题涉及由预定义的枢纽和非枢纽节点组成的网络中的商品路由。在这种情况下，将非集线器节点的业务外包给第三方运营商。这项研究的动机是，在现实世界的运输系统中，外包实践越来越普遍，新进入者或当地供应商越来越多地接管了运输链的一部分，从而实现了更高的运量和更广泛的网络覆盖。这个问题被建模为一个Stackelberg博弈：一个大公司（领导者）选择一个商品子集来服务。领导者的目标是将运输服务的第一步和最后一步外包给较小的运营商（追随者），每个非枢纽节点最多分配一个运营商。每个航空公司都寻求自己的利润最大化，这取决于领导者的报价。领导者的目标是确定最优的外包费用，并将运营商分配到非枢纽节点，从而使路由商品的利润最大化。必须考虑追随者的最佳反应，因为追随者可能会拒绝与他们的利润最大化目标不一致的分配。我们还考虑了两种可供选择的设置：一种是固定的外包费用，另一种是运营商接受任何产生非负利润的报价。我们证明了可行外包费用的集合可以离散化，并将问题表述为单级混合整数（非线性）规划。对于所有问题变体，我们证明了np -硬度，并对各种单级MIP重新公式进行了计算研究。我们的基准案例涵盖各种运输应用，例如航空运输、邮政配送和货运。我们评估了建议配方的可扩展性，并分析了不同运营商预订价格对解决方案质量的影响。最后，通过比较不同的问题设置，我们提取了有价值的管理见解。

{"title":"The multi-commodity flow problem with outsourcing decisions","authors":"Elena Fernández , Ivana Ljubić , Nicolás Zerega","doi":"10.1016/j.trb.2025.103333","DOIUrl":"10.1016/j.trb.2025.103333","url":null,"abstract":"<div><div>We introduce a new prize-collecting problem involving the routing of commodities in a network composed of predefined hub and non-hub nodes. In this setting, the service of non-hub nodes is outsourced to third-party carriers. This study is motivated by the growing prevalence of outsourcing practices in real-world transportation systems, where new entrants or local suppliers increasingly take over parts of the transportation chain – enabling higher volumes and broader network coverage. The problem is modeled as a Stackelberg game: a major firm (the leader) chooses a subset of commodities to serve. The leader aims to outsource the first and last legs of the transportation services to smaller carriers (the followers), assigning at most one carrier to each non-hub node. Each carrier seeks to maximize its own profit, which depends on the offers made by the leader. The goal of the leader is to determine the optimal outsourcing fees, along with the allocation of carriers to the non-hub nodes, so that the profit from the routed commodities is maximized. The optimal response of the followers must be taken into account, as the followers may reject assignments that do not align with their profit-maximizing goals. We also consider two alternative settings: one in which outsourcing fees are fixed, and another where carriers accept any offer yielding non-negative profit. We demonstrate that the set of feasible outsourcing fees can be discretized and formulate the problem as single-level mixed-integer (non)linear program. For all problem variants, we prove NP-hardness and conduct a computational study of various single-level MIP reformulations. Our benchmark instances cover various applications in transportation, such as air transportation, postal delivery and freight transportation. We assess the scalability of proposed formulations and analyze the impact of different carrier reservation prices on solution quality. Finally, by comparing the alternative problem settings, we extract valuable managerial insights.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103333"},"PeriodicalIF":6.3,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145223097","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

Designing reliable bus services with on-time arrival via lane reservation under uncertain travel times 在出行时间不确定的情况下，通过预留车道设计可靠的公交服务，保证准时到达

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-11-01 Epub Date: 2025-10-07 DOI: 10.1016/j.trb.2025.103322

Xinyi Zhang , Ada Che , Peng Wu , Andrea D’ Ariano

The deployment of dedicated bus lanes is a crucial strategy to improve the appeal of bus transit and is significantly affected by a variety of unpredictable events. This study proposes and investigates a novel optimization problem that jointly considers bus lane deployment and bus routing under uncertain travel times, with the objective of achieving reliable bus services with on-time arrivals. We first formulate it as a stochastic programming model. By leveraging prior data, we then construct a flexible moment information-based ambiguity set to capture uncertain link travel times and incorporate it into a distributionally robust optimization (DRO) model with a probabilistic objective function. The DRO model maximizes the reliability of bus services, defined as the probability of ensuring that a bus arrives on time at each stop in the worst-case scenario while simultaneously limiting passenger waiting times. Furthermore, we introduce a convex decision measure called Probability of Violation Risk to evaluate the risk of any stop not being arrived at within the predetermined expected time window. The designed model is then reformulated as a more tractable mixed-integer second-order cone program, upon which a two-stage matheuristic algorithm (TSMA) is developed specifically to solve large-scale realistic networks. Extensive computational tests are performed to verify the effectiveness and efficiency of the TSMA. The results demonstrate that the DRO model can generate robust dedicated lane deployment and bus routing schemes, with worst-case performance that surpasses those achieved using the widely adopted sample average approximation-based approach, an adapted Monte Carlo simulation-based metaheuristic algorithm, and the conventional Bonferroni correction-based method. Moreover, we compare the obtained solutions with those derived from deterministic and robust optimization models, as well as the DRO model based on the traditional moment ambiguity set. Additionally, we conduct numerical experiments to draw meaningful conclusions regarding the budget, maximum negative impact, tightness of expected arrival time windows, and on-time stop arrival rates.

公交专用道的设置是提高公交吸引力的关键策略，并且会受到各种不可预测事件的显著影响。本文提出并研究了在不确定出行时间下，共同考虑公交线道布置和公交线路的优化问题，以实现公交服务的可靠和准时到达为目标。我们首先将其表述为随机规划模型。通过利用先验数据，我们构建了一个基于柔性力矩信息的模糊集，以捕获不确定的链路行程时间，并将其纳入具有概率目标函数的分布鲁棒优化（DRO）模型。DRO模型最大限度地提高了公共汽车服务的可靠性，定义为在最坏情况下确保公共汽车准时到达每个站点，同时限制乘客等待时间的概率。在此基础上，引入了一个凸决策测度——违章风险概率，用于评价车辆在预定时间窗内未到达停车点的风险。然后将设计的模型重新表述为更易于处理的混合整数二阶锥规划，并在此基础上开发了一种专门用于求解大规模现实网络的两阶段数学算法（TSMA）。进行了大量的计算测试，以验证TSMA的有效性和效率。结果表明，DRO模型可以生成鲁棒的专用车道部署和总线路由方案，其最坏情况性能优于广泛采用的基于样本平均近似的方法、基于自适应蒙特卡罗模拟的元启发式算法和传统的基于Bonferroni校正的方法。此外，我们还将得到的解与确定性和鲁棒优化模型的解以及基于传统矩模糊集的DRO模型的解进行了比较。此外，我们还进行了数值实验，以得出有关预算，最大负面影响，预期到达时间窗口的紧密性和准时停止到达率的有意义的结论。

{"title":"Designing reliable bus services with on-time arrival via lane reservation under uncertain travel times","authors":"Xinyi Zhang , Ada Che , Peng Wu , Andrea D’ Ariano","doi":"10.1016/j.trb.2025.103322","DOIUrl":"10.1016/j.trb.2025.103322","url":null,"abstract":"<div><div>The deployment of dedicated bus lanes is a crucial strategy to improve the appeal of bus transit and is significantly affected by a variety of unpredictable events. This study proposes and investigates a novel optimization problem that jointly considers bus lane deployment and bus routing under uncertain travel times, with the objective of achieving reliable bus services with on-time arrivals. We first formulate it as a stochastic programming model. By leveraging prior data, we then construct a flexible moment information-based ambiguity set to capture uncertain link travel times and incorporate it into a distributionally robust optimization (DRO) model with a probabilistic objective function. The DRO model maximizes the reliability of bus services, defined as the probability of ensuring that a bus arrives on time at each stop in the worst-case scenario while simultaneously limiting passenger waiting times. Furthermore, we introduce a convex decision measure called <em>Probability of Violation Risk</em> to evaluate the risk of any stop not being arrived at within the predetermined expected time window. The designed model is then reformulated as a more tractable mixed-integer second-order cone program, upon which a two-stage matheuristic algorithm (TSMA) is developed specifically to solve large-scale realistic networks. Extensive computational tests are performed to verify the effectiveness and efficiency of the TSMA. The results demonstrate that the DRO model can generate robust dedicated lane deployment and bus routing schemes, with worst-case performance that surpasses those achieved using the widely adopted sample average approximation-based approach, an adapted Monte Carlo simulation-based metaheuristic algorithm, and the conventional Bonferroni correction-based method. Moreover, we compare the obtained solutions with those derived from deterministic and robust optimization models, as well as the DRO model based on the traditional moment ambiguity set. Additionally, we conduct numerical experiments to draw meaningful conclusions regarding the budget, maximum negative impact, tightness of expected arrival time windows, and on-time stop arrival rates.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103322"},"PeriodicalIF":6.3,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269298","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

Dynamics in credit-based mobility systems: Convergence to periodic mode usage equilibrium 基于信用的移动系统动力学：收敛到周期模式使用平衡

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-11-01 Epub Date: 2025-10-06 DOI: 10.1016/j.trb.2025.103310

Hongxing Ding , Xinwei Li , Hai Yang , Yafeng Yin

This study examines the flow, behavior, and credit dynamics under a credit charge-cum-reward (CCR) scheme that operates periodically. In this scheme, travelers incur an end-of-period credit cost, determined by their periodic mode usage patterns, in addition to regular mode-specific time and monetary costs. As such, travelers are incentivized to make decisions minimizing individual periodic travel costs rather than focusing solely on daily cost minimization. To formulate a CCR-scheme-based dynamic system, we analyze travelers’ intra-period and inter-period learning behaviors and propose two adaptation rules—myopic and forward-looking—for travelers making day-to-day choices. We provide optimal strategies for each traveler under these two rules and derive stability conditions for the dynamic system. Our findings demonstrate that, under mild conditions, both rules, along with travelers’ learning behaviors, lead the dynamic system to converge to a periodic mode usage equilibrium (PUE), where each traveler minimizes their periodic travel costs. Numerical examples illustrate the variations in system performance and traveler behavior across two adaptation rules. This study not only explores the evolution of a CCR-scheme-based dynamic mobility system toward the PUE but also highlights the distinct adaptation behaviors under periodic mobility management policies.

本研究考察了定期运行的信用收费加奖励（CCR）方案下的流程、行为和信用动态。在这个方案中，除了特定于常规模式的时间和金钱成本外，旅行者还要承担由他们的周期模式使用模式决定的期末信用成本。因此，旅行者被激励去做最小化个人定期旅行成本的决定，而不是仅仅关注每天的成本最小化。为了构建基于ccr方案的动态系统，我们分析了出境者的期内和期间学习行为，并针对出境者的日常选择提出了短视和前瞻两种适应规则。在这两种规则下给出了每个出行者的最优策略，并导出了动态系统的稳定性条件。我们的研究结果表明，在温和的条件下，这两种规则以及出行者的学习行为导致动态系统收敛到周期模式使用平衡（PUE），其中每个出行者的周期旅行成本最小。数值例子说明了两种适应规则下系统性能和出行者行为的变化。本研究不仅探讨了基于ccr方案的动态迁移系统向PUE的演变，而且强调了周期性迁移管理政策下不同的适应行为。

{"title":"Dynamics in credit-based mobility systems: Convergence to periodic mode usage equilibrium","authors":"Hongxing Ding , Xinwei Li , Hai Yang , Yafeng Yin","doi":"10.1016/j.trb.2025.103310","DOIUrl":"10.1016/j.trb.2025.103310","url":null,"abstract":"<div><div>This study examines the flow, behavior, and credit dynamics under a credit charge-cum-reward (CCR) scheme that operates periodically. In this scheme, travelers incur an end-of-period credit cost, determined by their periodic mode usage patterns, in addition to regular mode-specific time and monetary costs. As such, travelers are incentivized to make decisions minimizing individual periodic travel costs rather than focusing solely on daily cost minimization. To formulate a CCR-scheme-based dynamic system, we analyze travelers’ intra-period and inter-period learning behaviors and propose two adaptation rules—myopic and forward-looking—for travelers making day-to-day choices. We provide optimal strategies for each traveler under these two rules and derive stability conditions for the dynamic system. Our findings demonstrate that, under mild conditions, both rules, along with travelers’ learning behaviors, lead the dynamic system to converge to a periodic mode usage equilibrium (PUE), where each traveler minimizes their periodic travel costs. Numerical examples illustrate the variations in system performance and traveler behavior across two adaptation rules. This study not only explores the evolution of a CCR-scheme-based dynamic mobility system toward the PUE but also highlights the distinct adaptation behaviors under periodic mobility management policies.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103310"},"PeriodicalIF":6.3,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269297","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 cruise fleet deployment and itinerary scheduling problem: An enhanced Benders decomposition approach 综合邮轮舰队部署和行程安排问题：一种增强的Benders分解方法

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-11-01 Epub Date: 2025-09-29 DOI: 10.1016/j.trb.2025.103321

Ying Yang, Silong Zhang, Shuaian Wang

With the growing popularity of cruise tourism, the issue of comprehensive and precise cruise management is emphasized by the industrial field, which demands effective strategies in both tactical-level cruise deployment and operational-level itinerary scheduling. This rising concern and the expectation of integrated decision, however, increase the complexity of the problem and the difficulty of optimization. This paper provides a cohesive framework and scalable algorithms for the integrated cruise fleet deployment and itinerary scheduling problem. First, to address this problem, we propose an integer programming model based on a time-expanded network that captures the movement dynamics of cruises over a planning horizon. Several problem-specific reformulations including cumulative-flow-based variables and route-based time-expanded network representation are introduced, based on which, we prove that the itinerary scheduling problem is totally unimodular and the integer variables can be relaxed. Second, we introduce a tailored Benders decomposition approach augmented by the simultaneous Magnanti–Wong method, where a valid and pre-obtainable Magnanti–Wong bound is designed, yielding Pareto-optimal cuts in small computation time in each iteration. Finally, we validate our approach using extensive numerical experiments on both simulation instances and a real case study. The results demonstrate the effectiveness of our integrated solving scheme and the practical applicability of our advanced decomposition method, marking a significant advancement in the field of cruise fleet management.

随着邮轮旅游的日益普及，邮轮的全面、精准管理问题越来越受到工业界的重视，这就要求在战术层面的邮轮部署和运营层面的行程安排上都有有效的策略。然而，这种日益增长的关注和对综合决策的期望，增加了问题的复杂性和优化的难度。本文为邮轮编队部署和行程调度问题提供了一个内聚框架和可扩展算法。首先，为了解决这个问题，我们提出了一个基于时间扩展网络的整数规划模型，该模型可以在规划范围内捕获巡航的运动动态。引入了基于累积流的变量和基于路线的时间扩展网络表示，证明了行程调度问题是完全非模的，整数变量可以松弛。其次，我们引入了一种定制的Benders分解方法，该方法由同时的Magnanti-Wong方法扩展，其中设计了一个有效且可预获得的Magnanti-Wong界，在每次迭代中以较小的计算时间产生pareto最优切割。最后，我们在模拟实例和实际案例研究中使用广泛的数值实验来验证我们的方法。结果表明了综合求解方案的有效性和先进分解方法的实用性，在邮轮船队管理领域取得了重大进展。

{"title":"Integrated cruise fleet deployment and itinerary scheduling problem: An enhanced Benders decomposition approach","authors":"Ying Yang, Silong Zhang, Shuaian Wang","doi":"10.1016/j.trb.2025.103321","DOIUrl":"10.1016/j.trb.2025.103321","url":null,"abstract":"<div><div>With the growing popularity of cruise tourism, the issue of comprehensive and precise cruise management is emphasized by the industrial field, which demands effective strategies in both tactical-level cruise deployment and operational-level itinerary scheduling. This rising concern and the expectation of integrated decision, however, increase the complexity of the problem and the difficulty of optimization. This paper provides a cohesive framework and scalable algorithms for the integrated cruise fleet deployment and itinerary scheduling problem. First, to address this problem, we propose an integer programming model based on a time-expanded network that captures the movement dynamics of cruises over a planning horizon. Several problem-specific reformulations including cumulative-flow-based variables and route-based time-expanded network representation are introduced, based on which, we prove that the itinerary scheduling problem is totally unimodular and the integer variables can be relaxed. Second, we introduce a tailored Benders decomposition approach augmented by the simultaneous Magnanti–Wong method, where a valid and pre-obtainable Magnanti–Wong bound is designed, yielding Pareto-optimal cuts in small computation time in each iteration. Finally, we validate our approach using extensive numerical experiments on both simulation instances and a real case study. The results demonstrate the effectiveness of our integrated solving scheme and the practical applicability of our advanced decomposition method, marking a significant advancement in the field of cruise fleet management.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103321"},"PeriodicalIF":6.3,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145223011","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 scalable optimization approach for equitable facility location: Methodology and transportation applications 一个可扩展的优化方法为公平的设施选址：方法和运输应用

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-11-01 Epub Date: 2025-09-29 DOI: 10.1016/j.trb.2025.103319

Drew Horton , Joshua Murrell , Daphne Skipper , Emily Speakman , Tom Logan

Efficient and equitable access to essential services, such as healthcare, food, and education, is an important goal in urban planning, public policy, and transport logistics. However, existing facility location models often do not scale well to large instances, or primarily focus on optimizing average accessibility, neglecting equity concerns, particularly for disadvantaged populations. This paper proposes a novel, scalable framework for equitable facility location, introducing a linearized proxy for the Kolm-Pollak Equally-Distributed Equivalent (EDE) metric to balance efficiency and fairness. Computational experiments demonstrate that our approach scales to extremely large problem instances, while being sensitive enough to account for inequity throughout the distribution, not merely via the maximum value. Moreover, optimal solutions represent significant improvements for the worst-off residents in terms of distance to an open amenity, while also attaining a near-optimal average experience for all users. An extensive real-world case study on supermarket access illustrates the practical applicability of the framework, with additional examples coming from polling applications. As such, the model is extended to handle real-world considerations such as capacity constraints, split demand assignments, and location-specific penalties. By bridging the gap between equity theory and practical optimization, this work offers a robust and versatile tool for researchers and practitioners in urban planning, transportation, and public policy.

有效和公平地获得医疗保健、食品和教育等基本服务是城市规划、公共政策和运输物流的一个重要目标。然而，现有的设施选址模型往往不能很好地扩展到大型实例，或者主要侧重于优化平均可达性，而忽略了公平问题，特别是对弱势群体。本文提出了一种新的、可扩展的公平设施选址框架，引入了Kolm-Pollak等分布当量（EDE）度量的线性化代理，以平衡效率和公平性。计算实验表明，我们的方法适用于非常大的问题实例，同时足够敏感，可以解释整个分布的不平等，而不仅仅是通过最大值。此外，最优解决方案对于最贫困的居民来说，在与开放设施的距离方面有显著改善，同时也为所有用户实现了接近最佳的平均体验。一个关于超市访问的广泛的实际案例研究说明了该框架的实际适用性，还有来自轮询应用程序的其他示例。因此，该模型被扩展为处理现实世界的考虑因素，例如容量限制、需求分配和特定位置的惩罚。通过弥合公平理论与实践优化之间的差距，这项工作为城市规划、交通和公共政策的研究人员和实践者提供了一个强大而通用的工具。

{"title":"A scalable optimization approach for equitable facility location: Methodology and transportation applications","authors":"Drew Horton , Joshua Murrell , Daphne Skipper , Emily Speakman , Tom Logan","doi":"10.1016/j.trb.2025.103319","DOIUrl":"10.1016/j.trb.2025.103319","url":null,"abstract":"<div><div>Efficient and equitable access to essential services, such as healthcare, food, and education, is an important goal in urban planning, public policy, and transport logistics. However, existing facility location models often do not scale well to large instances, or primarily focus on optimizing average accessibility, neglecting equity concerns, particularly for disadvantaged populations. This paper proposes a novel, scalable framework for equitable facility location, introducing a linearized proxy for the Kolm-Pollak Equally-Distributed Equivalent (EDE) metric to balance efficiency and fairness. Computational experiments demonstrate that our approach scales to extremely large problem instances, while being sensitive enough to account for inequity throughout the distribution, not merely via the maximum value. Moreover, optimal solutions represent significant improvements for the worst-off residents in terms of distance to an open amenity, while also attaining a near-optimal average experience for all users. An extensive real-world case study on supermarket access illustrates the practical applicability of the framework, with additional examples coming from polling applications. As such, the model is extended to handle real-world considerations such as capacity constraints, split demand assignments, and location-specific penalties. By bridging the gap between equity theory and practical optimization, this work offers a robust and versatile tool for researchers and practitioners in urban planning, transportation, and public policy.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103319"},"PeriodicalIF":6.3,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222821","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

To park or to share your autonomous vehicle? 停车还是共享你的自动驾驶汽车？

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.103305

Zhuoye Zhang , Fangni Zhang , Wei Liu

With the ability to drive autonomously during trips and park themselves, autonomous vehicles (AVs) are anticipated to revolutionize future mobility. How AVs interact with people and transform travel behavior patterns (mobility paradigm shift) is expected to be a “game changer”. This paper investigates an innovative future mobility paradigm where private-AV owners can share their vehicles on a mobility service platform when not in use. We develop tractable models to characterize the travel, parking, and vehicle-sharing choices of AV users, optimize operation strategies of the mobility service platform considering AV sharing, and evaluate their system-wide impacts. In particular, given the operation strategies of the mobility service platform, we formulate the system equilibrium that includes the AV owners’ choice equilibrium and the mobility service market equilibrium. We consider two different business formats for platform operator (namely reselling and commissioning) and three types of AV owners (risk-neutral, risk-averse or risk-seeking). Subject to the system equilibrium, we examine the pricing and fleet sizing strategies of the platform to achieve either profit-maximization or social welfare-maximization. Our analysis explores the impacts of introducing the AV sharing scheme on AV owners, mobility service operator and users, and social welfare. It shows that introducing the AV sharing scheme has the potential to create a win-win-win outcome for AV owners, mobility service operator, and users, with an overall improvement in social welfare. Moreover, both a social welfare-maximizing operator and a profit-maximizing operator may achieve a win-win-win outcome under certain conditions. With risk-averse AV owners, the reselling format proves to be superior to the commissioning format; with risk-seeking AV owners, the commissioning format will outperform the reselling format; while with risk-neutral AV owners, both formats can yield identical platform profit and social welfare. Numerical examples are presented to illustrate the analytical results and provide a deeper understanding of the potential implications of AV sharing.

由于能够在旅途中自动驾驶和自动停车，自动驾驶汽车（AVs）有望彻底改变未来的出行方式。自动驾驶汽车如何与人互动并改变出行行为模式（移动模式转变）有望成为“游戏规则改变者”。本文研究了一种创新的未来移动模式，即私人自动驾驶汽车车主可以在不使用时在移动服务平台上共享他们的车辆。我们开发了可操作的模型来描述自动驾驶汽车用户的出行、停车和车辆共享选择，优化考虑自动驾驶汽车共享的出行服务平台的运营策略，并评估其对系统的影响。特别是考虑到出行服务平台的运营策略，我们构建了包含自动驾驶汽车车主选择均衡和出行服务市场均衡的系统均衡。我们考虑了平台运营商的两种不同业务模式（即转售和调试）和三种类型的AV所有者（风险中性、风险厌恶或风险寻求）。在系统均衡的前提下，我们研究了平台的定价和车队规模策略，以实现利润最大化或社会福利最大化。我们的分析探讨了引入自动驾驶汽车共享计划对自动驾驶汽车车主、移动服务运营商和用户以及社会福利的影响。研究显示，引入自动驾驶汽车共享计划，可为自动驾驶汽车车主、移动服务营运商和使用者创造三赢的结果，并整体改善社会福利。而且，在一定条件下，社会福利最大化的经营者和利润最大化的经营者都可能实现三赢。对于风险厌恶的AV所有者，转售格式被证明优于委托格式；对于喜欢冒险的影音车主，委托模式的表现将优于转售模式；而对于风险中性的自动驾驶车主，两种模式都可以产生相同的平台利润和社会福利。文中给出了数值例子来说明分析结果，并对AV共享的潜在影响提供了更深入的理解。

{"title":"To park or to share your autonomous vehicle?","authors":"Zhuoye Zhang , Fangni Zhang , Wei Liu","doi":"10.1016/j.trb.2025.103305","DOIUrl":"10.1016/j.trb.2025.103305","url":null,"abstract":"<div><div>With the ability to drive autonomously during trips and park themselves, autonomous vehicles (AVs) are anticipated to revolutionize future mobility. How AVs interact with people and transform travel behavior patterns (mobility paradigm shift) is expected to be a “game changer”. This paper investigates an innovative future mobility paradigm where private-AV owners can share their vehicles on a mobility service platform when not in use. We develop tractable models to characterize the travel, parking, and vehicle-sharing choices of AV users, optimize operation strategies of the mobility service platform considering AV sharing, and evaluate their system-wide impacts. In particular, given the operation strategies of the mobility service platform, we formulate the system equilibrium that includes the AV owners’ choice equilibrium and the mobility service market equilibrium. We consider two different business formats for platform operator (namely reselling and commissioning) and three types of AV owners (risk-neutral, risk-averse or risk-seeking). Subject to the system equilibrium, we examine the pricing and fleet sizing strategies of the platform to achieve either profit-maximization or social welfare-maximization. Our analysis explores the impacts of introducing the AV sharing scheme on AV owners, mobility service operator and users, and social welfare. It shows that introducing the AV sharing scheme has the potential to create a win-win-win outcome for AV owners, mobility service operator, and users, with an overall improvement in social welfare. Moreover, both a social welfare-maximizing operator and a profit-maximizing operator may achieve a win-win-win outcome under certain conditions. With risk-averse AV owners, the reselling format proves to be superior to the commissioning format; with risk-seeking AV owners, the commissioning format will outperform the reselling format; while with risk-neutral AV owners, both formats can yield identical platform profit and social welfare. Numerical examples are presented to illustrate the analytical results and provide a deeper understanding of the potential implications of AV sharing.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":""},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145010649","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

The value of partial and full pre-trip information under stochastic demand and bottleneck capacity in the morning commute 随机需求和瓶颈容量下的部分和全部出行前信息的价值

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

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

Zihan Wu , Zi-Yang Wang , Xiao Han , Rui Jiang , Ronghui Liu

This paper studies the welfare effects of providing pre-trip information to morning commuters in a single-bottleneck model, where both bottleneck capacity and travel demand are exogenously stochastic and assumed to follow an arbitrary joint distribution. We first derive the equilibrium travel costs under varying levels of information completeness, and then examine how information completeness influences travel costs and the key factors driving the welfare outcomes of information provision. We find that the welfare effects of providing pre-trip information are associated with the information completeness, the degree of correlation between bottleneck capacity and demand, and the frequency and amplitude of bottleneck capacity and demand changes. Although providing full information is never welfare-reducing, providing partial information can increase travel costs compared to no information (i.e., information paradox) when demand and bottleneck capacity are moderately correlated. Nevertheless, transitioning from partial to full information consistently leads to a reduction in travel costs. Our numerical examples further confirm the theoretical results and highlight the necessity of accounting for uncertainties in both supply and demand when developing traveler information systems.

本文研究了在单瓶颈模型下，向早晨通勤者提供出行前信息的福利效应，其中瓶颈容量和出行需求都是外生随机的，并假设服从任意联合分布。本文首先推导了不同信息完备性水平下的均衡出行成本，然后考察了信息完备性如何影响出行成本以及驱动信息提供福利结果的关键因素。研究发现，提供出行前信息的福利效应与信息完备性、瓶颈容量与需求的相关程度、瓶颈容量与需求变化的频率和幅度有关。尽管提供全部信息永远不会减少福利，但当需求和瓶颈容量适度相关时，提供部分信息比不提供信息（即信息悖论）会增加旅行成本。然而，从部分信息过渡到完全信息始终导致旅行费用的减少。我们的数值例子进一步证实了理论结果，并强调了在开发出行者信息系统时考虑供需不确定性的必要性。

{"title":"The value of partial and full pre-trip information under stochastic demand and bottleneck capacity in the morning commute","authors":"Zihan Wu , Zi-Yang Wang , Xiao Han , Rui Jiang , Ronghui Liu","doi":"10.1016/j.trb.2025.103311","DOIUrl":"10.1016/j.trb.2025.103311","url":null,"abstract":"<div><div>This paper studies the welfare effects of providing pre-trip information to morning commuters in a single-bottleneck model, where both bottleneck capacity and travel demand are exogenously stochastic and assumed to follow an arbitrary joint distribution. We first derive the equilibrium travel costs under varying levels of information completeness, and then examine how information completeness influences travel costs and the key factors driving the welfare outcomes of information provision. We find that the welfare effects of providing pre-trip information are associated with the information completeness, the degree of correlation between bottleneck capacity and demand, and the frequency and amplitude of bottleneck capacity and demand changes. Although providing full information is never welfare-reducing, providing partial information can increase travel costs compared to no information (i.e., information paradox) when demand and bottleneck capacity are moderately correlated. Nevertheless, transitioning from partial to full information consistently leads to a reduction in travel costs. Our numerical examples further confirm the theoretical results and highlight the necessity of accounting for uncertainties in both supply and demand when developing traveler information systems.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103311"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144932670","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 geometric cognition pedestrian dynamics model considering heterogeneous collision avoidance behaviors 考虑异构避碰行为的几何认知行人动力学模型

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.103309

Bohan Li , Yunchao Qu , Yao Xiao , Jianjun Wu , Ziyou Gao

Collision avoidance is one of the crucial behaviors in pedestrian dynamics, especially in high-density scenarios where it frequently occurs to maintain crowd safety and stability. However, the heterogeneity of this behavior has not been well investigated. Given the advantages of geometric compatibility, a microscopic pedestrian flow model combining the Voronoi diagram and velocity obstacle approaches has been proposed to fully quantify heterogeneous collision avoidance behavior. In this model, the velocity region is dynamically partitioned into three sub-regions to describe the avoidance behaviors with different levels of aggressiveness. The concept of the difference to collision velocity is defined to characterize the evolution of aggressiveness, and a heuristic velocity region evolution rule is proposed to determine the walking velocity. To demonstrate the effectiveness of the model, a series of pedestrian flow scenarios are validated in terms of fundamental diagrams, self-organization phenomena, and behavioral heterogeneity. The impact of heterogeneous collision avoidance behaviors on crowd phenomena is then analyzed according to simulations. The DF-GLS algorithm is used to determine the crowd re-stabilization time. The results show that more aggressive behaviors lead to obvious stop-and-go wave and smaller Yamori’s band index of lane formation phenomenon. Sudden aggressive behaviors will disrupt crowd stability and even cause the crowd into a disorganized state. This model offers valuable insights and supports the optimization of emergency evacuation strategies with practical applications.

避碰是行人动力学的关键行为之一，特别是在高密度场景下，为了维护人群的安全和稳定，避碰经常发生。然而，这种行为的异质性尚未得到很好的研究。考虑到几何兼容性的优势，提出了一种结合Voronoi图和速度障碍方法的微观行人流模型，以充分量化异构避碰行为。在该模型中，速度区域被动态划分为三个子区域来描述具有不同攻击程度的回避行为。定义了碰撞速度差的概念来表征攻击性的演化，并提出了一种启发式速度区域演化规则来确定行走速度。为了验证该模型的有效性，从基本图、自组织现象和行为异质性等方面验证了一系列行人流场景。通过仿真分析了异构避碰行为对人群现象的影响。采用DF-GLS算法确定人群再稳定时间。结果表明：侵略性行为越强，车道形成的走走停停波动越明显，车道形成的Yamori波段指数越小；突然的攻击行为会破坏群体的稳定，甚至使群体陷入无序状态。该模型提供了有价值的见解，并为实际应用中的应急疏散策略优化提供了支持。

{"title":"A geometric cognition pedestrian dynamics model considering heterogeneous collision avoidance behaviors","authors":"Bohan Li , Yunchao Qu , Yao Xiao , Jianjun Wu , Ziyou Gao","doi":"10.1016/j.trb.2025.103309","DOIUrl":"10.1016/j.trb.2025.103309","url":null,"abstract":"<div><div>Collision avoidance is one of the crucial behaviors in pedestrian dynamics, especially in high-density scenarios where it frequently occurs to maintain crowd safety and stability. However, the heterogeneity of this behavior has not been well investigated. Given the advantages of geometric compatibility, a microscopic pedestrian flow model combining the Voronoi diagram and velocity obstacle approaches has been proposed to fully quantify heterogeneous collision avoidance behavior. In this model, the velocity region is dynamically partitioned into three sub-regions to describe the avoidance behaviors with different levels of aggressiveness. The concept of the difference to collision velocity is defined to characterize the evolution of aggressiveness, and a heuristic velocity region evolution rule is proposed to determine the walking velocity. To demonstrate the effectiveness of the model, a series of pedestrian flow scenarios are validated in terms of fundamental diagrams, self-organization phenomena, and behavioral heterogeneity. The impact of heterogeneous collision avoidance behaviors on crowd phenomena is then analyzed according to simulations. The DF-GLS algorithm is used to determine the crowd re-stabilization time. The results show that more aggressive behaviors lead to obvious stop-and-go wave and smaller Yamori’s band index of lane formation phenomenon. Sudden aggressive behaviors will disrupt crowd stability and even cause the crowd into a disorganized state. This model offers valuable insights and supports the optimization of emergency evacuation strategies with practical applications.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103309"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144922206","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

Optimal matching for ridesharing systems with endogenous and flexible user participation 具有内生灵活用户参与的拼车系统的最优匹配

IF 6.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part B-Methodological

Pub Date : 2025-10-01 Epub Date: 2025-08-18 DOI: 10.1016/j.trb.2025.103290

Patrick Stokkink , Zhenyu Yang , Nikolas Geroliminis

The performance of ridesharing systems is intricately entwined with user participation. To characterize such interplay, we adopt a repeated multi-player, non-cooperative game approach to model a ridesharing platform and its users’ decision-making. Users reveal to the platform their participation preferences over being only riders, only drivers, flexible users, and opt-out based on the expected utilities of each mode. The platform optimally matches users with different itineraries and participation preferences to maximize social welfare. We analytically establish the existence and uniqueness of equilibria and design an iterative algorithm for the solution, for which convergence is guaranteed under mild conditions. A case study is conducted with real travel demand data in Chicago. The results highlight the effect of users’ flexibility regarding mode preferences on system performance (i.e., the average utility of users and the percentage of successful matches). A sensitivity analysis on the level of subsidy and the distribution of utility between matched riders and drivers shows that uneven distributions of utility may lead to a higher percentage of successful matches. Additional insights are provided on the effect of a user’s origin and destination locations on their role choice and likelihood to be matched.

拼车系统的性能与用户参与紧密相连。为了描述这种相互作用，我们采用了一种重复的多人非合作博弈方法来模拟拼车平台及其用户的决策。用户向平台透露了他们的参与偏好，包括只做乘客、只做司机、灵活的用户，以及根据每种模式的预期效用选择退出。平台优化匹配不同行程和参与偏好的用户，实现社会福利最大化。我们解析地建立了平衡点的存在唯一性，并设计了一种迭代算法，该算法在温和条件下保证了收敛性。以芝加哥的真实旅行需求数据为例进行了案例研究。结果突出了用户在模式偏好方面的灵活性对系统性能的影响（即，用户的平均效用和成功匹配的百分比）。对补贴水平和匹配骑手和司机之间效用分配的敏感性分析表明，效用分配的不均匀可能导致更高的匹配成功率。还提供了关于用户的原始位置和目的地位置对其角色选择和匹配可能性的影响的其他见解。

{"title":"Optimal matching for ridesharing systems with endogenous and flexible user participation","authors":"Patrick Stokkink , Zhenyu Yang , Nikolas Geroliminis","doi":"10.1016/j.trb.2025.103290","DOIUrl":"10.1016/j.trb.2025.103290","url":null,"abstract":"<div><div>The performance of ridesharing systems is intricately entwined with user participation. To characterize such interplay, we adopt a repeated multi-player, non-cooperative game approach to model a ridesharing platform and its users’ decision-making. Users reveal to the platform their participation preferences over being only riders, only drivers, flexible users, and opt-out based on the expected utilities of each mode. The platform optimally matches users with different itineraries and participation preferences to maximize social welfare. We analytically establish the existence and uniqueness of equilibria and design an iterative algorithm for the solution, for which convergence is guaranteed under mild conditions. A case study is conducted with real travel demand data in Chicago. The results highlight the effect of users’ flexibility regarding mode preferences on system performance (i.e., the average utility of users and the percentage of successful matches). A sensitivity analysis on the level of subsidy and the distribution of utility between matched riders and drivers shows that uneven distributions of utility may lead to a higher percentage of successful matches. Additional insights are provided on the effect of a user’s origin and destination locations on their role choice and likelihood to be matched.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103290"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144860278","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 flexible transport service for passenger and freight under stochastic demand and service time 随机需求和服务时间下的客货综合灵活运输服务

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.103313

Enoch Lee , Manzi Li , Lubing Li , Hong K. Lo

The growth of e-commerce has increased the pressure on urban freight systems, exacerbating traffic congestion and environmental costs. Conversely, public transport often has underutilized capacity, which presents an opportunity for freight transport. Building on this potential, we propose an integrated flexible transport system that serves both passenger and freight. We develop a two-stage stochastic optimization model that accounts for uncertainties in demand location, servie time, and volume for the integrated system. The flexible bus routes are strategically planned in the first stage, and actual passenger and freight orders are assigned to each bus in the second stage. To solve the problem, a reliability-based decomposition method is proposed to optimize reliability measures, determine the optimal flexible transport route, and minimize costs. Numerical studies show that integrating freight and passenger operations reduces costs by 12 %, while accounting for stochasticity reduces costs by 11.8 % compared to deterministic models. A case study in Manhattan validates the model's scalability and effectiveness in large-scale, real-world setting.

电子商务的发展增加了城市货运系统的压力，加剧了交通拥堵和环境成本。相反，公共交通的运力往往没有得到充分利用，这就为货运提供了机会。在这一潜力的基础上，我们提出了一个同时服务客运和货运的综合灵活运输系统。我们开发了一个两阶段随机优化模型，该模型考虑了集成系统在需求位置、服务时间和容量方面的不确定性。第一阶段对灵活的公交路线进行战略规划，第二阶段对每辆公交分配实际的客货订单。针对这一问题，提出了一种基于可靠性的分解方法，优化可靠性措施，确定最优的柔性运输路线，使成本最小化。数值研究表明，与确定性模型相比，综合货运和客运运营的成本降低了12% %，而考虑随机性的成本降低了11.8% %。曼哈顿的一个案例研究验证了该模型在大规模现实环境中的可扩展性和有效性。

{"title":"Integrated flexible transport service for passenger and freight under stochastic demand and service time","authors":"Enoch Lee , Manzi Li , Lubing Li , Hong K. Lo","doi":"10.1016/j.trb.2025.103313","DOIUrl":"10.1016/j.trb.2025.103313","url":null,"abstract":"<div><div>The growth of e-commerce has increased the pressure on urban freight systems, exacerbating traffic congestion and environmental costs. Conversely, public transport often has underutilized capacity, which presents an opportunity for freight transport. Building on this potential, we propose an integrated flexible transport system that serves both passenger and freight. We develop a two-stage stochastic optimization model that accounts for uncertainties in demand location, servie time, and volume for the integrated system. The flexible bus routes are strategically planned in the first stage, and actual passenger and freight orders are assigned to each bus in the second stage. To solve the problem, a reliability-based decomposition method is proposed to optimize reliability measures, determine the optimal flexible transport route, and minimize costs. Numerical studies show that integrating freight and passenger operations reduces costs by 12 %, while accounting for stochasticity reduces costs by 11.8 % compared to deterministic models. A case study in Manhattan validates the model's scalability and effectiveness in large-scale, real-world setting.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103313"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145019444","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