首页 > 最新文献

Transportation Research Part B-Methodological最新文献

英文 中文
Learning to generate synthetic human mobility data: A physics-regularized Gaussian process approach based on multiple kernel learning 学习生成合成人类移动数据:基于多核学习的物理规则化高斯过程方法
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-11-01 DOI: 10.1016/j.trb.2024.103064
Ekin Uğurel , Shuai Huang , Cynthia Chen
Passively-generated mobile data has grown increasingly popular in the travel behavior (or human mobility) literature. A relatively untapped potential for passively-generated mobile data is synthetic population generation, which is the basis for any large-scale simulations for purposes ranging from state monitoring, policy evaluation, and digital twins. And yet, this significant potential may be hindered by the growing sparsity or rate of missingness in the data, which stems from heightened privacy concerns among both data vendors and consumers (users of service platforms generating individual mobile data). To both fulfill the great potential and to address sparsity in the data, there is a need to develop a flexible and scalable model that can capture individual heterogeneity and adapt to changes in mobility patterns. We propose a conditional-generative Gaussian process framework that learns kernel structures characterizing individual mobile data and can provably replicate observed patterns. Our approach integrates physical knowledge to regularize the framework such that the generated data obeys constraints imposed by the built and natural environments (such as those on velocity and bearing). To capture travel behavior heterogeneity at the individual level, we propose a data-driven multiple kernel learning approach to determine the optimal composite kernel for every user. Our experiments demonstrate that: (1) the impact of kernel choice on mobility metrics derived from synthetic data is non-negligible; (2) physics-regularization not only reduces model bias but also improves uncertainty estimates associated with the predicted locations; and (3) the proposed method is robust and generalizes well to varying individuals and modes of travel.
被动生成的移动数据在旅行行为(或人类流动性)文献中越来越受欢迎。被动生成的移动数据还有一个相对尚未开发的潜力,那就是合成人口生成,这是为国家监控、政策评估和数字孪生等目的进行大规模模拟的基础。然而,由于数据供应商和消费者(生成个人移动数据的服务平台的用户)对隐私问题的高度关注,数据的稀疏性或遗漏率越来越高,这可能会阻碍这一巨大潜力的发挥。为了发挥数据的巨大潜力并解决数据稀疏性问题,有必要开发一种灵活且可扩展的模型,以捕捉个体异质性并适应移动模式的变化。我们提出了一种条件生成高斯过程框架,该框架可学习表征个体移动数据的核结构,并可证明它能复制观察到的模式。我们的方法整合了物理知识,对框架进行正则化,使生成的数据服从建筑环境和自然环境施加的约束(如速度和方位约束)。为了捕捉个人层面的旅行行为异质性,我们提出了一种数据驱动的多核学习方法,以确定每个用户的最佳复合核。我们的实验证明(1) 内核选择对从合成数据中得出的移动性指标的影响是不可忽略的;(2) 物理规则化不仅减少了模型偏差,还改善了与预测位置相关的不确定性估计;以及 (3) 所提出的方法是稳健的,并能很好地泛化到不同的个人和旅行模式中。
{"title":"Learning to generate synthetic human mobility data: A physics-regularized Gaussian process approach based on multiple kernel learning","authors":"Ekin Uğurel ,&nbsp;Shuai Huang ,&nbsp;Cynthia Chen","doi":"10.1016/j.trb.2024.103064","DOIUrl":"10.1016/j.trb.2024.103064","url":null,"abstract":"<div><div>Passively-generated mobile data has grown increasingly popular in the travel behavior (or human mobility) literature. A relatively untapped potential for passively-generated mobile data is synthetic population generation, which is the basis for any large-scale simulations for purposes ranging from state monitoring, policy evaluation, and digital twins. And yet, this significant potential may be hindered by the growing sparsity or rate of missingness in the data, which stems from heightened privacy concerns among both data vendors and consumers (users of service platforms generating individual mobile data). To both fulfill the great potential and to address sparsity in the data, there is a need to develop a flexible and scalable model that can capture individual heterogeneity and adapt to changes in mobility patterns. We propose a conditional-generative Gaussian process framework that learns kernel structures characterizing individual mobile data and can provably replicate observed patterns. Our approach integrates physical knowledge to regularize the framework such that the generated data obeys constraints imposed by the built and natural environments (such as those on velocity and bearing). To capture travel behavior heterogeneity at the individual level, we propose a data-driven multiple kernel learning approach to determine the optimal composite kernel for every user. Our experiments demonstrate that: (1) the impact of kernel choice on mobility metrics derived from synthetic data is non-negligible; (2) physics-regularization not only reduces model bias but also improves uncertainty estimates associated with the predicted locations; and (3) the proposed method is robust and generalizes well to varying individuals and modes of travel.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 103064"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142593875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Microscopic Discontinuities Disrupting Hydrodynamic and Continuum Traffic Flow Models 扰乱流体力学和连续交通流模型的微观不连续性
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-11-01 DOI: 10.1016/j.trb.2024.103068
Benjamin Coifman
This paper explores short duration disturbances in the traffic stream that are large enough to impact the traffic dynamics and disrupt stationarity when establishing the fundamental diagram, FD, but small enough that they are below the resolution of conventional vehicle detector data and cannot be seen using conventional methods. This empirical research develops the Exclusionary Vehicle Aggregation method (EVA) to extract high fidelity time series data from conventional loop detectors and then extends the method to measure the standard deviation of headways in a given fixed time sample, stdevh. Using loop detector data spanning 18 years and five sites, all of the sites show that samples with low stdevh tend towards a triangular FD while samples with high stdevh tend towards a concave FD that falls inside the triangular FD. The stdevh is also shown to be strongly correlated with the duration of the longest headway within the sample. The presence of a long headway means the state is perceptively different over the sample and thus, the measurement is non-stationary. A review of the earliest FD literature by Greenshields finds strong supporting evidence for these trends. Collectively, the loop detector and historical FD results span over 75 years of empirical traffic data.
Based on the EVA analysis, this work offers the following insights: the shape of equilibrium FD appears to be triangular and that conventional detector data mask critical features needed by hydrodynamic traffic flow models, HdTFM. Because the driver behind a long headway can act independent of their leader, the long headways can correspond to unobserved boundary conditions that generate kinematic waves. If these boundaries were detected many HdTFM could accommodate them, especially multi-class models. But the stochastic nature of the long headways also challenges the predictive abilities of deterministic HdTFM. Perhaps the largest of these challenges is driver agency- the driver behind a long headway can maintain it, resulting in signals propagating downstream or they can close the gap, resulting in signals propagating upstream. Meanwhile, this work provides a test for stationary conditions to help ensure an empirical FD supports the assumptions placed upon it.
本文探讨了交通流中的短时干扰,这些干扰大到足以影响交通动态,并在建立基本图(FD)时破坏静态,但又小到低于常规车辆检测器数据的分辨率,无法用常规方法看到。这项实证研究开发了排除性车辆聚合方法(EVA),从传统环路检测器中提取高保真时间序列数据,然后将该方法扩展到测量给定固定时间样本中的车行道标准偏差 stdevh。通过使用跨越 18 年和 5 个站点的环路检测器数据,所有站点都显示出,stdevh 低的样本趋向于三角形 FD,而 stdevh 高的样本趋向于三角形 FD 内部的凹形 FD。此外,stdevh 还与样本中最长航程的持续时间密切相关。最长时间间隔的存在意味着在整个样本中状态的感知是不同的,因此测量是非平稳的。Greenshields 对最早的 FD 文献进行了回顾,发现了这些趋势的有力佐证。基于 EVA 分析,这项研究提出了以下见解:平衡 FD 的形状似乎是三角形的,传统的检测器数据掩盖了流体力学交通流模型(HdTFM)所需的关键特征。由于长车头后面的驾驶员可以独立于他们的领导者行事,因此长车头可能对应于未被观测到的边界条件,从而产生运动波。如果能检测到这些边界条件,许多 HdTFM(尤其是多类模型)就能适应它们。但是,长航向的随机性也对确定性 HdTFM 的预测能力提出了挑战。这些挑战中最大的可能是驾驶员的作用--长距离车流后方的驾驶员可以保持长距离车流,导致信号向下游传播,也可以缩小车流间隙,导致信号向上游传播。同时,这项工作提供了静态条件测试,以帮助确保经验性 FD 支持其假设。
{"title":"Microscopic Discontinuities Disrupting Hydrodynamic and Continuum Traffic Flow Models","authors":"Benjamin Coifman","doi":"10.1016/j.trb.2024.103068","DOIUrl":"10.1016/j.trb.2024.103068","url":null,"abstract":"<div><div>This paper explores short duration disturbances in the traffic stream that are large enough to impact the traffic dynamics and disrupt stationarity when establishing the fundamental diagram, FD, but small enough that they are below the resolution of conventional vehicle detector data and cannot be seen using conventional methods. This empirical research develops the Exclusionary Vehicle Aggregation method (EVA) to extract high fidelity time series data from conventional loop detectors and then extends the method to measure the standard deviation of headways in a given fixed time sample, stdevh. Using loop detector data spanning 18 years and five sites, all of the sites show that samples with low stdevh tend towards a triangular FD while samples with high stdevh tend towards a concave FD that falls inside the triangular FD. The stdevh is also shown to be strongly correlated with the duration of the longest headway within the sample. The presence of a long headway means the state is perceptively different over the sample and thus, the measurement is non-stationary. A review of the earliest FD literature by Greenshields finds strong supporting evidence for these trends. Collectively, the loop detector and historical FD results span over 75 years of empirical traffic data.</div><div>Based on the EVA analysis, this work offers the following insights: the shape of equilibrium FD appears to be triangular and that conventional detector data mask critical features needed by hydrodynamic traffic flow models, HdTFM. Because the driver behind a long headway can act independent of their leader, the long headways can correspond to unobserved boundary conditions that generate kinematic waves. If these boundaries were detected many HdTFM could accommodate them, especially multi-class models. But the stochastic nature of the long headways also challenges the predictive abilities of deterministic HdTFM. Perhaps the largest of these challenges is driver agency- the driver behind a long headway can maintain it, resulting in signals propagating downstream or they can close the gap, resulting in signals propagating upstream. Meanwhile, this work provides a test for stationary conditions to help ensure an empirical FD supports the assumptions placed upon it.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 103068"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142593876","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
Stability analysis of a departure time choice problem with atomic vehicle models 利用原子车辆模型对出发时间选择问题进行稳定性分析
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-11-01 DOI: 10.1016/j.trb.2024.103039
Koki Satsukawa , Kentaro Wada , Takamasa Iryo
In this study, we analyse the global stability of the equilibrium in a departure time choice problem using a game-theoretic approach that deals with atomic users. We first formulate the departure time choice problem as a strategic game in which atomic users select departure times to minimise their trip cost; we call this game the ‘departure time choice game’. The concept of the epsilon-Nash equilibrium is introduced to ensure the existence of pure-strategy equilibrium corresponding to the departure time choice equilibrium in conventional fluid models. Then, we prove that the departure time choice game is a weakly acyclic game. By analysing the convergent better responses, we clarify the mechanisms of global convergence to equilibrium. This means that the epsilon-Nash equilibrium is achieved by sequential better responses of users, which are departure time changes to improve their own utility, in an appropriate order. Specifically, the following behavioural rules are important to ensure global convergence: (i) the adjustment of the departure time of the first user departing from the origin to the corresponding equilibrium departure time and (ii) the fixation of users to their equilibrium departure times in order (starting with the earliest). Using convergence mechanisms, we construct evolutionary dynamics under which global stability is guaranteed. We also investigate the stable and unstable dynamics studied in the literature based on convergence mechanisms, and gain insight into the factors influencing the different stability results. Finally, numerical experiments are conducted to demonstrate the theoretical results.
在本研究中,我们采用博弈论的方法分析了出发时间选择问题中均衡的全局稳定性。我们首先将出发时间选择问题表述为一个战略博弈,在这个博弈中,原子用户选择出发时间以最小化其旅行成本;我们称这个博弈为 "出发时间选择博弈"。我们引入了ε-纳什均衡的概念,以确保存在与传统流体模型中出发时间选择均衡相对应的纯策略均衡。然后,我们证明出发时间选择博弈是弱非循环博弈。通过分析收敛的更好反应,我们阐明了全局收敛到均衡的机制。这意味着ε-纳什均衡是通过用户按适当顺序依次做出更好的反应(即改变出发时间以提高自身效用)来实现的。具体来说,以下行为规则对确保全局收敛非常重要:(i) 将第一个从原点出发的用户的出发时间调整为相应的均衡出发时间;(ii) 按顺序(从最早出发的用户开始)将用户的均衡出发时间固定下来。利用收敛机制,我们构建了保证全局稳定的演化动力学。我们还基于收敛机制研究了文献中研究的稳定和不稳定动力学,并深入了解了影响不同稳定性结果的因素。最后,我们进行了数值实验来证明理论结果。
{"title":"Stability analysis of a departure time choice problem with atomic vehicle models","authors":"Koki Satsukawa ,&nbsp;Kentaro Wada ,&nbsp;Takamasa Iryo","doi":"10.1016/j.trb.2024.103039","DOIUrl":"10.1016/j.trb.2024.103039","url":null,"abstract":"<div><div>In this study, we analyse the global stability of the equilibrium in a departure time choice problem using a game-theoretic approach that deals with atomic users. We first formulate the departure time choice problem as a strategic game in which atomic users select departure times to minimise their trip cost; we call this game the ‘departure time choice game’. The concept of the epsilon-Nash equilibrium is introduced to ensure the existence of pure-strategy equilibrium corresponding to the departure time choice equilibrium in conventional fluid models. Then, we prove that the departure time choice game is a weakly acyclic game. By analysing the convergent better responses, we clarify the mechanisms of global convergence to equilibrium. This means that the epsilon-Nash equilibrium is achieved by sequential better responses of users, which are departure time changes to improve their own utility, in an appropriate order. Specifically, the following behavioural rules are important to ensure global convergence: (i) the adjustment of the departure time of the first user departing from the origin to the corresponding equilibrium departure time and (ii) the fixation of users to their equilibrium departure times in order (starting with the earliest). Using convergence mechanisms, we construct evolutionary dynamics under which global stability is guaranteed. We also investigate the stable and unstable dynamics studied in the literature based on convergence mechanisms, and gain insight into the factors influencing the different stability results. Finally, numerical experiments are conducted to demonstrate the theoretical results.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 103039"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sensor placement considering the observability of traffic dynamics: On the algebraic and graphical perspectives 考虑交通动态可观测性的传感器布置:代数与图形视角
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-11-01 DOI: 10.1016/j.trb.2024.103057
Xinyue Hu, Yueyue Fan
In this paper, we present a new sensor location model that aims to maximize observability of link densities in a dynamic traffic network described using a piecewise linear system of ordinary differential equations. We develop an algebraic approach based on the eigenstructure to determine the sensor location for achieving full observability with a minimal number of sensors. Additionally, a graphical approach based on the concept of structural observability is developed. By exploiting the special property of flow conservation in traffic networks, we derive a simple analytical result that can be used to identify observable components in a partially observable system, which is the main contribution of this paper. The graphical and algebraic properties of observability are then integrated into a sensor location optimization model considering a wide range of traffic conditions. Through numerical experiments, we demonstrate the good performance of our sensor deployment strategies in terms of the average observability and estimation errors.
在本文中,我们提出了一种新的传感器位置模型,旨在最大限度地观测使用片断线性常微分方程系统描述的动态交通网络中的链路密度。我们开发了一种基于特征结构的代数方法,用于确定传感器位置,从而以最少的传感器数量实现完全可观测性。此外,我们还开发了一种基于结构可观测性概念的图形方法。通过利用交通网络中流量守恒的特殊属性,我们得出了一个简单的分析结果,可用于识别部分可观测系统中的可观测成分,这也是本文的主要贡献。然后,我们将可观测性的图形和代数特性整合到一个传感器位置优化模型中,该模型考虑了多种交通状况。通过数值实验,我们证明了传感器部署策略在平均可观测性和估计误差方面的良好性能。
{"title":"Sensor placement considering the observability of traffic dynamics: On the algebraic and graphical perspectives","authors":"Xinyue Hu,&nbsp;Yueyue Fan","doi":"10.1016/j.trb.2024.103057","DOIUrl":"10.1016/j.trb.2024.103057","url":null,"abstract":"<div><div>In this paper, we present a new sensor location model that aims to maximize observability of link densities in a dynamic traffic network described using a piecewise linear system of ordinary differential equations. We develop an algebraic approach based on the eigenstructure to determine the sensor location for achieving full observability with a minimal number of sensors. Additionally, a graphical approach based on the concept of structural observability is developed. By exploiting the special property of flow conservation in traffic networks, we derive a simple analytical result that can be used to identify observable components in a partially observable system, which is the main contribution of this paper. The graphical and algebraic properties of observability are then integrated into a sensor location optimization model considering a wide range of traffic conditions. Through numerical experiments, we demonstrate the good performance of our sensor deployment strategies in terms of the average observability and estimation errors.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 103057"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142593874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Combining time dependency and behavioral game: A Deep Markov Cognitive Hierarchy Model for human-like discretionary lane changing modeling 时间依赖性与行为游戏相结合:用于类人酌情变道建模的深度马尔可夫认知层次模型
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-11-01 DOI: 10.1016/j.trb.2024.102980
Kehua Chen , Meixin Zhu , Lijun Sun , Hai Yang
Human drivers take discretionary lane changes when the target lane is perceived to offer better traffic conditions. Improper discretionary lane changes, however, lead to traffic congestion or even crashes. Considering its significant impact on traffic flow efficiency and safety, accurate modeling and prediction of discretionary lane-changing (LC) behavior is an important component in microscopic traffic analysis. Due to the interaction process and driver behavior stochasticity, modeling discretionary lane-changing behavior is a non-trivial task. Existing approaches include rule-based, utility-based, game-based, and data-driven ones, but they fail to balance the trade-off between modeling accuracy and interpretability. To address this gap, we propose a novel model, called Deep Markov Cognitive Hierarchy Model (DMCHM) which combines time dependency and behavioral game interaction for discretionary lane-changing modeling. Specifically, the lane-changing interaction process between the subject vehicle and the following vehicle in the target lane is modeled as a two-player game. We then introduce three dynamic latent variables for interaction aggressiveness, cognitive level, and payoffs based on the Hidden Markov Model. The proposed DMCHM combines time dependency together with cognitive hierarchy behavioral games while preserving model interpretability. Extensive experiments on three real-world driving datasets demonstrate that DMCHM outperforms other game-theoretic baselines and has comparable performance with state-of-the-art deep learning methods in time and location errors. Besides, we employ SHAP values to present the model interpretability. The analysis reveals that the proposed model has good performance in discretionary LC prediction with high interpretability. Finally, we conduct an agent-based simulation to investigate the impact of various driving styles on macroscopic traffic flows. The simulation shows that the existence of massive aggressive drivers can increase traffic capacity because of small gaps during car-following, but inversely decrease discretionary LC rates. A balanced mixing of conservative and aggressive driving styles promotes discretionary LC frequencies since conservative car-following behaviors provide more spaces for LC. The codes can be found at https://github.com/zeonchen/DMCHM.
人类驾驶员在认为目标车道的交通状况更好时,会酌情变更车道。然而,不恰当的随意变道会导致交通拥堵甚至撞车。考虑到随意变道(LC)行为对交通流效率和安全的重大影响,对其进行精确建模和预测是微观交通分析的重要组成部分。由于交互过程和驾驶员行为的随机性,对随意变道行为建模是一项艰巨的任务。现有的方法包括基于规则、基于效用、基于游戏和数据驱动的方法,但这些方法未能在建模准确性和可解释性之间取得平衡。为了弥补这一不足,我们提出了一种名为 "深度马尔可夫认知层次模型"(DMCHM)的新型模型,该模型结合了时间依赖性和行为游戏交互性,可用于随意变道建模。具体来说,目标车道上的主体车辆与后续车辆之间的变道互动过程被建模为双人博弈。然后,我们在隐马尔可夫模型的基础上引入了交互攻击性、认知水平和报酬三个动态潜变量。所提出的 DMCHM 将时间依赖性与认知层次行为博弈相结合,同时保留了模型的可解释性。在三个真实世界驾驶数据集上进行的广泛实验表明,DMCHM 的表现优于其他博弈论基线,在时间和位置误差方面与最先进的深度学习方法性能相当。此外,我们还利用 SHAP 值来呈现模型的可解释性。分析表明,所提出的模型在自由裁量 LC 预测方面具有良好的性能和较高的可解释性。最后,我们进行了基于代理的模拟,以研究各种驾驶方式对宏观交通流的影响。模拟结果表明,大量激进驾驶者的存在会因跟车过程中的小间隙而增加交通容量,但会反向降低自由裁量低速行驶率。保守型和激进型驾驶风格的均衡混合会促进随意低速行驶频率,因为保守型跟车行为为低速行驶提供了更多空间。代码见 https://github.com/zeonchen/DMCHM。
{"title":"Combining time dependency and behavioral game: A Deep Markov Cognitive Hierarchy Model for human-like discretionary lane changing modeling","authors":"Kehua Chen ,&nbsp;Meixin Zhu ,&nbsp;Lijun Sun ,&nbsp;Hai Yang","doi":"10.1016/j.trb.2024.102980","DOIUrl":"10.1016/j.trb.2024.102980","url":null,"abstract":"<div><div><span>Human drivers take discretionary lane changes when the target lane is perceived to offer better traffic conditions. Improper discretionary lane changes, however, lead to traffic congestion or even crashes. Considering its significant impact on traffic flow efficiency and safety, accurate modeling and prediction of discretionary lane-changing (LC) behavior is an important component in microscopic traffic analysis. Due to the interaction process and driver behavior stochasticity<span>, modeling discretionary lane-changing behavior is a non-trivial task. Existing approaches include rule-based, utility-based, game-based, and data-driven ones, but they fail to balance the trade-off between modeling accuracy and interpretability. To address this gap, we propose a novel model, called Deep Markov Cognitive Hierarchy Model (DMCHM) which combines time dependency and behavioral game interaction for discretionary lane-changing modeling. Specifically, the lane-changing interaction process between the subject vehicle and the following vehicle in the target lane is modeled as a two-player game. We then introduce three dynamic latent variables for interaction aggressiveness, cognitive level, and payoffs based on the Hidden Markov Model<span>. The proposed DMCHM combines time dependency together with cognitive hierarchy behavioral games while preserving model interpretability. Extensive experiments on three real-world driving datasets demonstrate that DMCHM outperforms other game-theoretic baselines and has comparable performance with state-of-the-art deep learning methods in time and location errors. Besides, we employ SHAP values to present the model interpretability. The analysis reveals that the proposed model has good performance in discretionary LC prediction with high interpretability. Finally, we conduct an agent-based simulation to investigate the impact of various driving styles on macroscopic traffic flows. The simulation shows that the existence of massive aggressive drivers can increase traffic capacity because of small gaps during car-following, but inversely decrease discretionary LC rates. A balanced mixing of conservative and aggressive driving styles promotes discretionary LC frequencies since conservative car-following behaviors provide more spaces for LC. The codes can be found at </span></span></span><span><span>https://github.com/zeonchen/DMCHM</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 102980"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594047","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 operation strategies of an urban crowdshipping platform in asset-light, asset-medium, or asset-heavy business format 轻资产、中资产或重资产业态下城市众包平台的优化运营策略
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-11-01 DOI: 10.1016/j.trb.2024.102992
Zhuoye Zhang, Fangni Zhang
This paper investigates the operation strategies of an urban crowdshipping platform, which utilizes the latent capacity of the traveling ‘crowd’ in the transportation system to facilitate parcel delivery. We develop an analytical model to characterize the decision-making and operation strategies of a crowdshipping operator in alternative business formats (asset-light/medium/heavy). Asset-light platforms connect customers with potential carriers in the crowd without involving delivery assets, whereas asset-medium and asset-heavy operators integrate crowd carriers with outsourced or owned delivery fleets, respectively. In particular, we firstly formulate the two-sided market equilibrium of crowdshipping system on account of customers’ willingness to use and crowds’ willingness to serve. Based on the market equilibrium, the crowdshipping operator’s optimal strategies in terms of pricing and/or fleet sizing are identified for profit-maximization or social welfare-maximization in alternative business formats. We show that the introduction of crowdshipping can simultaneously improve the benefits of logistics customers, the crowd, and the crowdshipping platform operator, leading to a win-win-win outcome. Furthermore, we establish analytical conditions for one business format being superior to another. We find that if the externality (or marginal social cost) of an unmatched order is smaller in a particular business format, it will result in larger consumer surplus for customers, greater net benefit for crowd carriers, and more profit for crowdshipping operator. Under mild conditions, the crowdshipping operator adopting the asset-light or asset-medium format can earn a positive profit at the social optimum.
本文研究了城市众包平台的运营策略,该平台利用交通系统中出行 "人群 "的潜在能力来促进包裹递送。我们建立了一个分析模型,以描述不同业态(轻资产/中资产/重资产)的众包运输运营商的决策和运营策略。轻资产平台将客户与人群中的潜在承运人联系起来,不涉及配送资产,而中资产和重资产运营商则分别将人群承运人与外包或自有配送车队整合起来。具体而言,我们首先根据客户的使用意愿和人群的服务意愿,提出了众包系统的双面市场均衡。在市场均衡的基础上,我们确定了众包运营商在定价和/或车队规模方面的最优策略,以实现不同业态下的利润最大化或社会福利最大化。我们的研究表明,引入众包服务可以同时提高物流客户、人群和众包平台运营商的利益,从而实现三赢。此外,我们还建立了一种业态优于另一种业态的分析条件。我们发现,如果某一业态中未匹配订单的外部性(或边际社会成本)较小,就会为客户带来更大的消费者剩余,为人群承运商带来更大的净收益,为众包运输运营商带来更多利润。在温和条件下,采用轻资产或中资产业态的众包运营商可以在社会最优状态下获得正利润。
{"title":"Optimal operation strategies of an urban crowdshipping platform in asset-light, asset-medium, or asset-heavy business format","authors":"Zhuoye Zhang,&nbsp;Fangni Zhang","doi":"10.1016/j.trb.2024.102992","DOIUrl":"10.1016/j.trb.2024.102992","url":null,"abstract":"<div><div><span>This paper investigates the operation strategies of an urban crowdshipping platform, which utilizes the latent capacity of the traveling ‘crowd’ in the transportation system to facilitate parcel delivery. We develop an analytical model to characterize the decision-making and operation strategies of a crowdshipping operator in alternative business formats (asset-light/medium/heavy). Asset-light platforms connect customers with potential carriers in the crowd without involving delivery assets, whereas asset-medium and asset-heavy operators integrate crowd carriers with outsourced or owned delivery fleets, respectively. In particular, we firstly formulate the two-sided market equilibrium of crowdshipping system on account of customers’ willingness to use and crowds’ willingness to serve. Based on the market equilibrium, the crowdshipping operator’s optimal strategies in terms of pricing and/or fleet sizing are identified for profit-maximization or social welfare-maximization in alternative business formats. We show that the introduction of crowdshipping can simultaneously improve the benefits of logistics customers, the crowd, and the crowdshipping platform operator, leading to a win-win-win outcome. Furthermore, we establish analytical conditions for one business format being superior to another. We find that if the externality (or marginal social cost) of an unmatched order is smaller in a particular business format, it will result in larger </span>consumer surplus for customers, greater net benefit for crowd carriers, and more profit for crowdshipping operator. Under mild conditions, the crowdshipping operator adopting the asset-light or asset-medium format can earn a positive profit at the social optimum.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 102992"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594050","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
Dynamic flow control model and algorithm for metro network under FIFO condition 先进先出条件下的地铁网络动态流量控制模型和算法
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-10-30 DOI: 10.1016/j.trb.2024.103089
Ping Zhang , Jianjun Wu , Kai Wang , Yunchao Qu , Jiancheng Long
Implementing passenger flow control strategies is an effective approach to reducing commuter travel delays and ensuring crowd safety in a congested metro network. Due to the intricacy of the interweaving of passenger flows between various lines and stations, the development of a scientific passenger flow control strategy is challenging in the networked mode of operation. The first-in-first-out (FIFO) rule can ensure service fairness and optimal operation by accurate modeling passenger queuing dynamics, but it is rarely considered in existing studies. Inspired by the traditional dynamic traffic assignment models, we propose a novel passenger flow control model with the FIFO rule to find a more reasonable control strategy for a metro network. Unlike road traffic systems, the FIFO rule is formulated as a set of linear constraints to explicitly capture the passenger queuing properties at origin stations. The passenger flow control problem with the FIFO rule is then modeled as a mixed integer linear programming model, which can significantly reduce the model complexity. To reach a high-quality solution, we propose an efficient rolling horizon decomposition approach. In the algorithm, the planning horizon is rolled forward from the current time, and the effects of subsequent periods are considered at each iteration. Besides, a dynamic procedure for loading passengers is developed to evaluate the bounds between the proposed approach and other flow control strategies. The proposed model and algorithm are then applied to solve the problems in test and real metro networks. The numerical results demonstrate the validity of the model’s properties and the algorithm’s performance.
在拥挤的地铁网络中,实施客流控制策略是减少乘客出行延误、确保人群安全的有效方法。由于不同线路和车站之间的客流交织错综复杂,在网络化运营模式下,制定科学的客流控制策略具有一定的挑战性。先进先出(FIFO)规则可以通过精确模拟乘客排队动态来确保服务公平性和优化运营,但在现有研究中却很少被考虑。受传统动态交通分配模型的启发,我们提出了一种采用先进先出规则的新型客流控制模型,为地铁网络寻找更合理的控制策略。与道路交通系统不同,先进先出规则被表述为一组线性约束,以明确捕捉始发站的乘客排队特性。采用先进先出规则的客流控制问题被建模为混合整数线性规划模型,从而大大降低了模型的复杂性。为了获得高质量的解决方案,我们提出了一种高效的滚动水平分解方法。在该算法中,规划期限从当前时间向前滚动,每次迭代都要考虑后续时段的影响。此外,我们还开发了一种乘客装载动态程序,以评估所提出的方法与其他流量控制策略之间的界限。然后,将提出的模型和算法应用于解决测试和实际地铁网络中的问题。数值结果证明了模型属性和算法性能的有效性。
{"title":"Dynamic flow control model and algorithm for metro network under FIFO condition","authors":"Ping Zhang ,&nbsp;Jianjun Wu ,&nbsp;Kai Wang ,&nbsp;Yunchao Qu ,&nbsp;Jiancheng Long","doi":"10.1016/j.trb.2024.103089","DOIUrl":"10.1016/j.trb.2024.103089","url":null,"abstract":"<div><div>Implementing passenger flow control strategies is an effective approach to reducing commuter travel delays and ensuring crowd safety in a congested metro network. Due to the intricacy of the interweaving of passenger flows between various lines and stations, the development of a scientific passenger flow control strategy is challenging in the networked mode of operation. The first-in-first-out (FIFO) rule can ensure service fairness and optimal operation by accurate modeling passenger queuing dynamics, but it is rarely considered in existing studies. Inspired by the traditional dynamic traffic assignment models, we propose a novel passenger flow control model with the FIFO rule to find a more reasonable control strategy for a metro network. Unlike road traffic systems, the FIFO rule is formulated as a set of linear constraints to explicitly capture the passenger queuing properties at origin stations. The passenger flow control problem with the FIFO rule is then modeled as a mixed integer linear programming model, which can significantly reduce the model complexity. To reach a high-quality solution, we propose an efficient rolling horizon decomposition approach. In the algorithm, the planning horizon is rolled forward from the current time, and the effects of subsequent periods are considered at each iteration. Besides, a dynamic procedure for loading passengers is developed to evaluate the bounds between the proposed approach and other flow control strategies. The proposed model and algorithm are then applied to solve the problems in test and real metro networks. The numerical results demonstrate the validity of the model’s properties and the algorithm’s performance.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103089"},"PeriodicalIF":5.8,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142553284","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
Generating online freight delivery demand during COVID-19 using limited data 利用有限数据生成 COVID-19 期间的在线货运需求
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-10-30 DOI: 10.1016/j.trb.2024.103100
Majid Mirzanezhad , Richard Twumasi-Boakye , Tayo Fabusuyi , Andrea Broaddus
Urban freight data analysis is crucial for informed decision-making, resource allocation, and optimizing routes, leading to efficient and sustainable freight operations in cities. Driven in part by the COVID-19 pandemic, the pace of online purchases for at-home delivery has accelerated significantly. However, responding to this development has been challenging given the lack of public data. The existing data may be infrequent because of survey participant non-responses. This data paucity renders conventional predictive models unreliable.
We address this shortcoming by developing algorithms for data imputation and replication for future urban freight demand given limited ground truth online freight delivery data. Our generic framework is capable of taking in repeated cross-sectional surveys and replicating frequent samples from them. In this paper, our case study is focused on Puget Sound Regional Council (PSRC) household travel survey (HTS) data restricted to the Seattle–Tacoma–Bellevue, WA Metropolitan Statistical Area (MSA). We show how to impute the missing online freight deliveries in our travel survey dataset from ground truth values by making a similarity-based matching between the samples of missing and available online delivery volumes. Empirical and theoretical analyses both demonstrate high veracity of imputation where the estimated freight delivery volumes closely resemble the ground truth values. Utilizing the obtained similarity-based matching, we show how to generate data across future and past travel survey datasets with an emphasis on maintaining some consistent trends across the datasets. This work furthers existing methods in demand estimation for goods deliveries by maximizing available scarce data to generate reasonable estimates that could facilitate policy decisions.
城市货运数据分析对于知情决策、资源分配和优化路线至关重要,可帮助城市实现高效、可持续的货运运营。在 COVID-19 大流行的部分推动下,网上购物送货上门的步伐明显加快。然而,由于缺乏公共数据,应对这一发展一直是一项挑战。由于调查参与者未作回复,现有数据可能并不频繁。针对这一缺陷,我们开发了数据估算和复制算法,在有限的地面真实在线货运交付数据的基础上,预测未来城市货运需求。我们的通用框架能够接受重复的横截面调查,并从中复制频繁的样本。在本文中,我们的案例研究侧重于普吉特海湾地区委员会(PSRC)仅限于华盛顿州西雅图-塔科马-贝尔维尤大都会统计区(MSA)的家庭旅行调查(HTS)数据。我们展示了如何通过在缺失的在线交付量样本和可用的在线交付量样本之间进行基于相似性的匹配,根据地面真实值对旅行调查数据集中缺失的在线货运交付量进行估算。经验分析和理论分析都证明了估算的高真实性,估算的货运量与地面真实值非常接近。利用所获得的基于相似性的匹配,我们展示了如何在未来和过去的旅行调查数据集之间生成数据,重点是在数据集之间保持一些一致的趋势。这项工作通过最大限度地利用现有的稀缺数据来生成合理的估计值,从而促进政策决策的制定,推动了现有的货物交付需求估计方法的发展。
{"title":"Generating online freight delivery demand during COVID-19 using limited data","authors":"Majid Mirzanezhad ,&nbsp;Richard Twumasi-Boakye ,&nbsp;Tayo Fabusuyi ,&nbsp;Andrea Broaddus","doi":"10.1016/j.trb.2024.103100","DOIUrl":"10.1016/j.trb.2024.103100","url":null,"abstract":"<div><div>Urban freight data analysis is crucial for informed decision-making, resource allocation, and optimizing routes, leading to efficient and sustainable freight operations in cities. Driven in part by the COVID-19 pandemic, the pace of online purchases for at-home delivery has accelerated significantly. However, responding to this development has been challenging given the lack of public data. The existing data may be infrequent because of survey participant non-responses. This data paucity renders conventional predictive models unreliable.</div><div>We address this shortcoming by developing algorithms for data imputation and replication for future urban freight demand given limited ground truth online freight delivery data. Our generic framework is capable of taking in repeated cross-sectional surveys and replicating frequent samples from them. In this paper, our case study is focused on Puget Sound Regional Council (PSRC) household travel survey (HTS) data restricted to the Seattle–Tacoma–Bellevue, WA Metropolitan Statistical Area (MSA). We show how to impute the missing online freight deliveries in our travel survey dataset from ground truth values by making a similarity-based matching between the samples of missing and available online delivery volumes. Empirical and theoretical analyses both demonstrate high veracity of imputation where the estimated freight delivery volumes closely resemble the ground truth values. Utilizing the obtained similarity-based matching, we show how to generate data across future and past travel survey datasets with an emphasis on maintaining some consistent trends across the datasets. This work furthers existing methods in demand estimation for goods deliveries by maximizing available scarce data to generate reasonable estimates that could facilitate policy decisions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103100"},"PeriodicalIF":5.8,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142553306","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
Revisiting the traffic flow observability problem: A matrix-based model for traffic networks with or without centroid nodes 重新审视交通流可观测性问题:基于矩阵的有无中心点交通网络模型
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-10-28 DOI: 10.1016/j.trb.2024.103099
Yue Zhuo , Hu Shao , William H.K. Lam , Mei Lam Tam , Shuhan Cao
This study introduces a graph theory-based model that addresses the link flow observability problem in traffic networks by optimizing passive sensor deployment. The model aims to determine the minimal number of sensors and their optimal placement. It constructs a virtual network and uses isomorphic graph theory to map between the original and virtual networks, ensuring consistency in nodes, links, and link directions. Two formulas are proposed to calculate the minimum number of observable links required across different networks, factoring in links, ordinary nodes, centroid nodes, and added links. Key concepts such as chords, cut sets, and loops, along with their matrices, are analyzed. A matrix-based framework is developed to consider flow conservation conditions. Results show that solving the full link flow observability problem using node flow conservation equations yields a fixed number of sensors with non-unique deployment schemes, Additionally, a resource-constrained sensor network optimization (RSNO) model is presented, employing null space projection (NSP) as an objective function to quantify the impact of budget constraints particularly under the condition if all the link flows cannot be observed. Numerical examples demonstrate the RSNO model's applications.
本研究介绍了一种基于图论的模型,该模型通过优化无源传感器部署来解决交通网络中的链路流量可观测性问题。该模型旨在确定传感器的最小数量及其最佳位置。它构建了一个虚拟网络,并使用同构图论在原始网络和虚拟网络之间进行映射,确保节点、链路和链路方向的一致性。它提出了两个公式来计算不同网络所需的最小可观测链接数,并将链接、普通节点、中心节点和添加链接考虑在内。分析了弦、切割集和循环等关键概念及其矩阵。还开发了一个基于矩阵的框架来考虑流量守恒条件。结果表明,使用节点流量守恒方程求解全链路流量可观测性问题,可以得到具有非唯一部署方案的固定数量传感器。此外,还提出了一种资源受限的传感器网络优化(RSNO)模型,采用空空间投影(NSP)作为目标函数,量化预算约束的影响,尤其是在无法观测到所有链路流量的情况下。数值示例展示了 RSNO 模型的应用。
{"title":"Revisiting the traffic flow observability problem: A matrix-based model for traffic networks with or without centroid nodes","authors":"Yue Zhuo ,&nbsp;Hu Shao ,&nbsp;William H.K. Lam ,&nbsp;Mei Lam Tam ,&nbsp;Shuhan Cao","doi":"10.1016/j.trb.2024.103099","DOIUrl":"10.1016/j.trb.2024.103099","url":null,"abstract":"<div><div>This study introduces a graph theory-based model that addresses the link flow observability problem in traffic networks by optimizing passive sensor deployment. The model aims to determine the minimal number of sensors and their optimal placement. It constructs a virtual network and uses isomorphic graph theory to map between the original and virtual networks, ensuring consistency in nodes, links, and link directions. Two formulas are proposed to calculate the minimum number of observable links required across different networks, factoring in links, ordinary nodes, centroid nodes, and added links. Key concepts such as chords, cut sets, and loops, along with their matrices, are analyzed. A matrix-based framework is developed to consider flow conservation conditions. Results show that solving the full link flow observability problem using node flow conservation equations yields a fixed number of sensors with non-unique deployment schemes, Additionally, a resource-constrained sensor network optimization (RSNO) model is presented, employing null space projection (NSP) as an objective function to quantify the impact of budget constraints particularly under the condition if all the link flows cannot be observed. Numerical examples demonstrate the RSNO model's applications.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103099"},"PeriodicalIF":5.8,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142530880","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 multi-visit drone-assisted routing problem with soft time windows and stochastic truck travel times 具有软时间窗口和随机卡车旅行时间的无人机辅助多次访问路由问题
IF 5.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2024-10-23 DOI: 10.1016/j.trb.2024.103101
Shanshan Meng , Dong Li , Jiyin Liu , Yanru Chen
We consider a combined truck-drone delivery problem with stochastic truck travel times and soft time windows. A fleet of homogeneous trucks and drones are deployed in pairs to provide delivery services to customers. Each drone can be launched from and retrieved to its truck multiple times, and in each flight, a drone can serve one or more customers. Our objective is to determine the truck routes and drone flights that minimise the total cost, including time window violation penalties. We formulate this problem into a two-stage stochastic model with recourse action in the second stage to optimise the truck waiting time at each node. We approximate the stochastic model with a large-scale mixed-integer program using the sample average approximation (SAA) framework, which is computationally intractable. To this end, we propose a hybrid metaheuristic approach that incorporates SAA. The waiting times of each truck obtained in the planning phase are optimal against the sampled or estimated travel times along the entire route, but the actual values are known only once the truck has returned to the depot. To this end, we reformulate the second-stage model in a rolling-horizon manner, which can be easily implemented and efficiently solved in the execution phase. Extensive numerical experiments demonstrate the strong performance of the proposed metaheuristic approach and rolling-horizon model. The results also highlight the clear benefits of the stochastic modelling approach over its deterministic counterpart, with a pronounced reduction in the total cost in various scenarios.
我们考虑的是卡车和无人机联合送货问题,该问题具有随机卡车行程时间和软时间窗口。由同质卡车和无人机组成的车队成对部署,为客户提供送货服务。每架无人机都可以多次从卡车上发射并收回,在每次飞行中,无人机可以为一个或多个客户提供服务。我们的目标是确定卡车路线和无人机航班,使总成本(包括时间窗口违规惩罚)最小化。我们将这一问题转化为一个两阶段随机模型,在第二阶段采取追索行动,以优化卡车在每个节点的等待时间。我们使用抽样平均近似(SAA)框架,用大规模混合整数程序来近似该随机模型,但这在计算上很难实现。为此,我们提出了一种结合 SAA 的混合元启发式方法。在规划阶段获得的每辆卡车的等待时间与整个路线上的采样或估计行驶时间相比是最优的,但实际值只有在卡车返回车厂后才能知道。为此,我们以滚动视距方式重新制定了第二阶段模型,在执行阶段可以轻松实现并高效求解。广泛的数值实验证明了所提出的元启发式方法和滚动地平线模型的强大性能。实验结果还凸显了随机建模方法相对于确定性建模方法的明显优势,在各种情况下都能显著降低总成本。
{"title":"The multi-visit drone-assisted routing problem with soft time windows and stochastic truck travel times","authors":"Shanshan Meng ,&nbsp;Dong Li ,&nbsp;Jiyin Liu ,&nbsp;Yanru Chen","doi":"10.1016/j.trb.2024.103101","DOIUrl":"10.1016/j.trb.2024.103101","url":null,"abstract":"<div><div>We consider a combined truck-drone delivery problem with stochastic truck travel times and soft time windows. A fleet of homogeneous trucks and drones are deployed in pairs to provide delivery services to customers. Each drone can be launched from and retrieved to its truck multiple times, and in each flight, a drone can serve one or more customers. Our objective is to determine the truck routes and drone flights that minimise the total cost, including time window violation penalties. We formulate this problem into a two-stage stochastic model with recourse action in the second stage to optimise the truck waiting time at each node. We approximate the stochastic model with a large-scale mixed-integer program using the sample average approximation (SAA) framework, which is computationally intractable. To this end, we propose a hybrid metaheuristic approach that incorporates SAA. The waiting times of each truck obtained in the planning phase are optimal against the sampled or estimated travel times along the entire route, but the actual values are known only once the truck has returned to the depot. To this end, we reformulate the second-stage model in a rolling-horizon manner, which can be easily implemented and efficiently solved in the execution phase. Extensive numerical experiments demonstrate the strong performance of the proposed metaheuristic approach and rolling-horizon model. The results also highlight the clear benefits of the stochastic modelling approach over its deterministic counterpart, with a pronounced reduction in the total cost in various scenarios.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103101"},"PeriodicalIF":5.8,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142530881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Transportation Research Part B-Methodological
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1