首页 > 最新文献

Transportation Letters-The International Journal of Transportation Research最新文献

英文 中文
Parcel locker location problem with selectable volume sizes and heterogeneous customers in the last mile delivery 在 "最后一英里 "递送过程中,包裹储物柜的位置问题与可选择的体积大小和异质客户有关
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2277013
This study introduces a novel parcel locker location problem in the last mile delivery where each parcel locker is equipped with a set of selectable volume sizes and provides services for two types of customers: commuters and home-based customers. We establish a pickup cost model to quantify the effort exerted by customers during the retrieval process. Furthermore, we design a satisfaction function to measure customers’ willingness to retrieve items from a specific parcel locker. Finally, we implement a financial incentive mechanism to enhance customer satisfaction by reducing the pickup cost. To solve this problem, we formulate a problem-specific scatter search algorithm. Extensive experiments demonstrate the computational effectiveness of the proposed algorithm. Furthermore, sensitivity analyses show that the selectable volume size model can reduce the total cost by up to 16.8%, while “pickup on the way” can achieve a reduction of up to 63.97% in our instances.
本研究在最后一英里配送中引入了一个新颖的包裹储物柜定位问题,每个包裹储物柜都配备了一组可选择的容量大小,并为两类客户提供服务:通勤客户和家庭客户。我们建立了一个取件成本模型,以量化客户在取件过程中所付出的努力。此外,我们还设计了一个满意度函数来衡量客户从特定包裹储物柜取回物品的意愿。最后,我们实施了一种经济激励机制,通过降低取件成本来提高客户满意度。为了解决这个问题,我们提出了一种针对具体问题的散点搜索算法。广泛的实验证明了所提算法的计算有效性。此外,敏感性分析表明,在我们的实例中,可选择的体积大小模型最多可将总成本降低 16.8%,而 "途中取货 "最多可将总成本降低 63.97%。
{"title":"Parcel locker location problem with selectable volume sizes and heterogeneous customers in the last mile delivery","authors":"","doi":"10.1080/19427867.2023.2277013","DOIUrl":"10.1080/19427867.2023.2277013","url":null,"abstract":"<div><div>This study introduces a novel parcel locker location problem in the last mile delivery where each parcel locker is equipped with a set of selectable volume sizes and provides services for two types of customers: commuters and home-based customers. We establish a pickup cost model to quantify the effort exerted by customers during the retrieval process. Furthermore, we design a satisfaction function to measure customers’ willingness to retrieve items from a specific parcel locker. Finally, we implement a financial incentive mechanism to enhance customer satisfaction by reducing the pickup cost. To solve this problem, we formulate a problem-specific scatter search algorithm. Extensive experiments demonstrate the computational effectiveness of the proposed algorithm. Furthermore, sensitivity analyses show that the selectable volume size model can reduce the total cost by up to 16.8%, while “pickup on the way” can achieve a reduction of up to 63.97% in our instances.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1140-1154"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135286122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Metro stop-skipping rescheduling optimization considering passenger waiting time fairness 考虑乘客等待时间公平性的地铁跳站重新安排优化方案
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2270243
In urban metro systems, unexpected events often occur to cause discordance in the planned timetable and delay in passenger travel. Therefore, this study focuses on the timetable rescheduling problem by adopting a stop-skipping strategy during the off-peak period. In addition, there are a number of existing optimization models that minimize the total passenger waiting time, which can cause fairness issues for a small group of passengers having longer waiting time at some stations. In this study, a rescheduling model is proposed to consider passenger waiting time fairness and train travel time cost. This model is tested with a randomly designed delay scenario of Nanjing Metro Line 2, which can be efficiently solved by a designed iterative algorithm based on decomposition method. Compared to the standard stop pattern, the result shows that the stop-skipping pattern can better alleviate the impact of sudden delays, while simultaneously ensuring the passenger waiting time fairness.
在城市地铁系统中,经常会发生突发事件,导致计划时刻表不一致,延误乘客行程。因此,本研究重点关注在非高峰期采用跳站策略重新安排时刻表的问题。此外,现有的一些优化模型都是使乘客的总等候时间最小化,这可能会对在某些车站等候时间较长的一小部分乘客造成公平性问题。在本研究中,提出了一种考虑乘客等候时间公平性和列车旅行时间成本的重新安排模型。该模型通过南京地铁二号线随机设计的延误场景进行了测试,并通过基于分解法设计的迭代算法进行了有效求解。结果表明,与标准停车模式相比,跳站模式能更好地缓解突发延误的影响,同时保证乘客候车时间的公平性。
{"title":"Metro stop-skipping rescheduling optimization considering passenger waiting time fairness","authors":"","doi":"10.1080/19427867.2023.2270243","DOIUrl":"10.1080/19427867.2023.2270243","url":null,"abstract":"<div><div>In urban metro systems, unexpected events often occur to cause discordance in the planned timetable and delay in passenger travel. Therefore, this study focuses on the timetable rescheduling problem by adopting a stop-skipping strategy during the off-peak period. In addition, there are a number of existing optimization models that minimize the total passenger waiting time, which can cause fairness issues for a small group of passengers having longer waiting time at some stations. In this study, a rescheduling model is proposed to consider passenger waiting time fairness and train travel time cost. This model is tested with a randomly designed delay scenario of Nanjing Metro Line 2, which can be efficiently solved by a designed iterative algorithm based on decomposition method. Compared to the standard stop pattern, the result shows that the stop-skipping pattern can better alleviate the impact of sudden delays, while simultaneously ensuring the passenger waiting time fairness.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1115-1125"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135888859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Integrated optimization of intermittent lane intersection design and dynamic signal control: efficiency, safety, and fuel consumption 间歇车道交叉口设计和动态信号控制的综合优化:效率、安全和油耗
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2278854
Existing unconventional intersection designs can enhance the capacity of intersections to deal with repaid pressure on urban commuting, whereas they force vehicles to multi-stop and reorganize, resulting in safety risks and high fuel consumption. This paper proposes the Intermittent Lane Intersection (ILI) that combines the advantages of variable lane intersection and CTE (Combining the tandem control and exit lanes for left-turn control). An integrated optimization model is established to obtain the optimal geometric and signal control parameters, and a homothermic genetic algorithm is used to solve the model. Then, the application of ILI in different traffic demands of the Tianfu Third Street intersection is analyzed. Compared with the benchmark design (TI, CTE, and CTE with signal coordinated control), ILI can effectively reduce intersection delay, fuel consumption, and parking times. Additionally, ILI has great application superiority when the traffic arrival rate is [1500,1700] and the left-turn ratio is [0.40,0.60].
现有的非常规交叉口设计可以提高交叉口的通行能力,以应对城市通勤的补给压力,但却迫使车辆多次停车和重组,造成安全隐患和高油耗。本文提出的间歇车道交叉口(ILI)结合了可变车道交叉口和 CTE(结合串联控制和出口车道进行左转控制)的优点。建立了一个综合优化模型,以获得最佳几何和信号控制参数,并使用同温遗传算法对模型进行求解。然后,分析了 ILI 在天府三街交叉口不同交通需求下的应用。与基准设计(TI、CTE 和带信号协调控制的 CTE)相比,ILI 可有效减少交叉口延误、油耗和停车时间。此外,当交通到达率为[1500,1700],左转率为[0.40,0.60]时,ILI 具有很大的应用优势。
{"title":"The Integrated optimization of intermittent lane intersection design and dynamic signal control: efficiency, safety, and fuel consumption","authors":"","doi":"10.1080/19427867.2023.2278854","DOIUrl":"10.1080/19427867.2023.2278854","url":null,"abstract":"<div><div>Existing unconventional intersection designs can enhance the capacity of intersections to deal with repaid pressure on urban commuting, whereas they force vehicles to multi-stop and reorganize, resulting in safety risks and high fuel consumption. This paper proposes the Intermittent Lane Intersection (ILI) that combines the advantages of variable lane intersection and CTE (Combining the tandem control and exit lanes for left-turn control). An integrated optimization model is established to obtain the optimal geometric and signal control parameters, and a homothermic genetic algorithm is used to solve the model. Then, the application of ILI in different traffic demands of the Tianfu Third Street intersection is analyzed. Compared with the benchmark design (TI, CTE, and CTE with signal coordinated control), ILI can effectively reduce intersection delay, fuel consumption, and parking times. Additionally, ILI has great application superiority when the traffic arrival rate is [1500,1700] and the left-turn ratio is [0.40,0.60].</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1155-1169"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135242091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A fast-response mathematical programming approach for delivering disaster relief goods: an earthquake case study 运送救灾物资的快速反应数学编程方法:地震案例研究
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2270238
This paper tackles a complex logistics challenge of disaster management, encompassing warehouse location, pre-disaster inventory planning, routing, and post-disaster relief supply delivery. We establish an iterative process for optimizing relief distribution to shelters. Adaptable warehouse inventory reallocation responds to fluctuating demands, guided by a two-phase mathematical programming approach. In the first phase, a two-stage stochastic programming (TSSP) model determines optimal warehouse and shelter locations and inventory levels. In the subsequent phase, we introduce a mixed-integer programming (MIP) model to minimize the overall delivery time by making routing decisions. To streamline the process, we introduce a novel enumeration algorithm that trims down route options by considering unavailable links, effectively transforming the MIP model into an assignment-based model. This innovation results in a noticeable 74% reduction in solution time. Further efficiency is achieved by developing a branch-and-cut algorithm for swift MIP resolution. A real-world case study confirms the practicality of our approach.
本文探讨了灾害管理中的一项复杂物流挑战,包括仓库选址、灾前库存规划、路线规划和灾后救援物资运送。我们建立了一个迭代流程,用于优化向避难所的救灾物资配送。在两阶段数学编程方法的指导下,可调整的仓库库存重新分配可应对波动的需求。在第一阶段,一个两阶段随机编程(TSSP)模型确定了最佳仓库和避难所位置及库存水平。在随后的阶段,我们引入了一个混合整数编程(MIP)模型,通过路由决策最大限度地缩短整体交付时间。为了简化这一过程,我们引入了一种新颖的枚举算法,通过考虑不可用的链接来减少路由选项,从而有效地将 MIP 模型转化为基于分配的模型。这一创新显著缩短了 74% 的求解时间。通过开发一种用于快速解决 MIP 问题的分支切割算法,进一步提高了效率。一项实际案例研究证实了我们方法的实用性。
{"title":"A fast-response mathematical programming approach for delivering disaster relief goods: an earthquake case study","authors":"","doi":"10.1080/19427867.2023.2270238","DOIUrl":"10.1080/19427867.2023.2270238","url":null,"abstract":"<div><div>This paper tackles a complex logistics challenge of disaster management, encompassing warehouse location, pre-disaster inventory planning, routing, and post-disaster relief supply delivery. We establish an iterative process for optimizing relief distribution to shelters. Adaptable warehouse inventory reallocation responds to fluctuating demands, guided by a two-phase mathematical programming approach. In the first phase, a two-stage stochastic programming (TSSP) model determines optimal warehouse and shelter locations and inventory levels. In the subsequent phase, we introduce a mixed-integer programming (MIP) model to minimize the overall delivery time by making routing decisions. To streamline the process, we introduce a novel enumeration algorithm that trims down route options by considering unavailable links, effectively transforming the MIP model into an assignment-based model. This innovation results in a noticeable 74% reduction in solution time. Further efficiency is achieved by developing a branch-and-cut algorithm for swift MIP resolution. A real-world case study confirms the practicality of our approach.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1091-1114"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135221723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Investigating the spatial heterogeneity of factors influencing speeding-related crash severities using correlated random parameter order models with heterogeneity-in-means 利用具有均值异质性的相关随机参数秩模型研究影响超速行驶相关碰撞严重程度的因素的空间异质性
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2262201
Speeding has been acknowledged as a critical determinant in increasing the risk of crashes and their resulting injury severities. This paper employs Global Moran’s I coefficient and local Getis – Ord G* indexes to systematically account for the spatial distribution feature of speeding-related crashes, study the global spatial pattern of speeding-related crashes, and identify severe crash cluster districts. The findings demonstrate that severe speeding-related crashes within the state of Pennsylvania have a spatial clustering trend, where four crash datasets are extracted from four hotspot districts. Two log-likelihood ratio (LR) tests were conducted to determine whether speeding-related crashes classified by hotspot districts should be modeled separately. The results suggest that separate modeling is necessary. To capture the unobserved heterogeneity, four correlated random parameter order models with heterogeneity in means are employed to explore the factors contributing to crash severity involving at least one vehicle speeding.
超速已被公认为是增加撞车风险及其造成的严重伤害的关键决定因素。本文采用全局莫兰 I 系数和局部 Getis - Ord G* 指数系统地解释了超速相关碰撞事故的空间分布特征,研究了超速相关碰撞事故的全局空间模式,并确定了严重碰撞事故集群区。研究结果表明,宾夕法尼亚州内与超速相关的严重碰撞事故具有空间集群趋势,其中从四个热点地区提取了四个碰撞事故数据集。为了确定按热点地区分类的超速相关碰撞事故是否应单独建模,进行了两次对数似然比(LR)检验。结果表明,单独建模是必要的。为了捕捉未观察到的异质性,我们采用了四个具有均值异质性的相关随机参数阶次模型,以探讨导致至少有一辆车超速的碰撞严重程度的因素。
{"title":"Investigating the spatial heterogeneity of factors influencing speeding-related crash severities using correlated random parameter order models with heterogeneity-in-means","authors":"","doi":"10.1080/19427867.2023.2262201","DOIUrl":"10.1080/19427867.2023.2262201","url":null,"abstract":"<div><div>Speeding has been acknowledged as a critical determinant in increasing the risk of crashes and their resulting injury severities. This paper employs Global Moran’s I coefficient and local Getis – Ord G* indexes to systematically account for the spatial distribution feature of speeding-related crashes, study the global spatial pattern of speeding-related crashes, and identify severe crash cluster districts. The findings demonstrate that severe speeding-related crashes within the state of Pennsylvania have a spatial clustering trend, where four crash datasets are extracted from four hotspot districts. Two log-likelihood ratio (LR) tests were conducted to determine whether speeding-related crashes classified by hotspot districts should be modeled separately. The results suggest that separate modeling is necessary. To capture the unobserved heterogeneity, four correlated random parameter order models with heterogeneity in means are employed to explore the factors contributing to crash severity involving at least one vehicle speeding.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 989-1001"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135548622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimizing electric bus charging infrastructure deployment under two charging modes considering seasonal differences 考虑季节差异,优化两种充电模式下的电动公交车充电基础设施部署
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2275855
The innovations of battery and charging technologies facilitate worldwide bus electrification, which can conserve energy and reduce emissions. The emergence of wireless power transfer technology offers the potential to alleviate bus range anxiety. This paper constructs the layout models of static wireless and centralized charging stations based on the seasonal differences associated with battery capacities and passenger flow, which aims to obtain the bus charging station layout scheme of the lowest cost. Then, the heuristic algorithm is utilized to solve the layout models as the mixed linear programming problem. This study results confirm that the combined layout of static wireless and centralized charging stations is more advantageous than a single model. Finally, the required fixed cost of supporting bus system operation is explored for future capital reserves.
电池和充电技术的创新促进了全球范围内的巴士电气化,从而节约能源并减少排放。无线电力传输技术的出现为缓解公交车的续航焦虑提供了可能。本文根据电池容量和客流量的季节性差异,构建了静态无线充电站和集中充电站的布局模型,旨在获得成本最低的公交充电站布局方案。然后,利用启发式算法将布局模型作为混合线性规划问题进行求解。研究结果证实,静态无线充电站和集中充电站的组合布局比单一模式更具优势。最后,还探讨了支持公交系统运营所需的固定成本,以便为未来的资本储备做准备。
{"title":"Optimizing electric bus charging infrastructure deployment under two charging modes considering seasonal differences","authors":"","doi":"10.1080/19427867.2023.2275855","DOIUrl":"10.1080/19427867.2023.2275855","url":null,"abstract":"<div><div>The innovations of battery and charging technologies facilitate worldwide bus electrification, which can conserve energy and reduce emissions. The emergence of wireless power transfer technology offers the potential to alleviate bus range anxiety. This paper constructs the layout models of static wireless and centralized charging stations based on the seasonal differences associated with battery capacities and passenger flow, which aims to obtain the bus charging station layout scheme of the lowest cost. Then, the heuristic algorithm is utilized to solve the layout models as the mixed linear programming problem. This study results confirm that the combined layout of static wireless and centralized charging stations is more advantageous than a single model. Finally, the required fixed cost of supporting bus system operation is explored for future capital reserves.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1126-1139"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135679849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Pre-peak fare discount policy for managing morning peak demand of interregional bus travel: a case study in Seoul metropolitan area 管理早高峰区域间公交出行需求的高峰前票价折扣政策:首尔大都市区案例研究
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2264048
Pre-peak fare discount policies have become increasingly common in urban transit services and show potential to spread morning peak-hour demand. This study analyzes the departure time choice behavior of interregional bus passengers during morning hours. A mixed logit model is applied to estimate the probability of shifting departure time as a function of fare discount rate, in-vehicle congestion, and other influential factors, accommodating heterogeneity of passenger preferences. The analysis data are obtained through a stated preference survey, which is conducted to passengers who regularly use the interregional bus in Seoul metropolitan area. Choice models are segmented by departure time periods (peak, pre-peak, and post-peak) and occupation types (fixed time worker, flexible time worker, and student). Marginal utilities of the unobserved preferences are estimated to suggest policy implications. From the experimental analysis, target passengers for shifting departure time during peak hour are suggested as flexible time workers and students.
高峰前票价折扣政策在城市公交服务中越来越常见,并显示出分散早高峰时段需求的潜力。本研究分析了区域间公交乘客在上午时段的发车时间选择行为。在考虑乘客偏好异质性的基础上,采用混合对数模型估算了票价折扣率、车内拥堵和其他影响因素作用下的发车时间偏移概率。分析数据是通过陈述偏好调查获得的,调查对象是经常乘坐首尔市区区间公交车的乘客。选择模型按出发时间段(高峰、前高峰和后高峰)和职业类型(固定时间工作者、灵活时间工作者和学生)进行细分。对未观察到的偏好的边际效用进行估算,以提出政策影响。实验分析结果表明,在高峰时段改变发车时间的目标乘客是灵活时间工作者和学生。
{"title":"Pre-peak fare discount policy for managing morning peak demand of interregional bus travel: a case study in Seoul metropolitan area","authors":"","doi":"10.1080/19427867.2023.2264048","DOIUrl":"10.1080/19427867.2023.2264048","url":null,"abstract":"<div><div>Pre-peak fare discount policies have become increasingly common in urban transit services and show potential to spread morning peak-hour demand. This study analyzes the departure time choice behavior of interregional bus passengers during morning hours. A mixed logit model is applied to estimate the probability of shifting departure time as a function of fare discount rate, in-vehicle congestion, and other influential factors, accommodating heterogeneity of passenger preferences. The analysis data are obtained through a stated preference survey, which is conducted to passengers who regularly use the interregional bus in Seoul metropolitan area. Choice models are segmented by departure time periods (peak, pre-peak, and post-peak) and occupation types (fixed time worker, flexible time worker, and student). Marginal utilities of the unobserved preferences are estimated to suggest policy implications. From the experimental analysis, target passengers for shifting departure time during peak hour are suggested as flexible time workers and students.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1059-1068"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135740404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Real-time Vulnerability Analysis of Urban Expressway 城市快速路实时脆弱性分析
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2260972
This study proposes a new method for evaluating the road network vulnerability per unit time: the real-time vulnerability index (RVI). The practical application of the proposed measure in real traffic scenarios is investigated by using empirical data from Shanghai Expressway.To prevent traffic congestion, a critical threshold of RVI (RVI*) is suggested for traffic control. Furthermore, the hysteresis on macroscopic fundamental diagram (MFD) and RVI is further analyzed in the phase transition of traffic states. The results show that RVI can help derive some representative traffic characteristics in real time and dynamically reflect road network vulnerability: when traffic congestion or accidents occur on the road network, the results observed for the traffic hysteresis on MFD and RVI were consistent, and RVI is easier to observe and more suitable for traffic management. The findings prove that RVI is a reliable indicator to help predict the dynamic operation of the road network.
本研究提出了一种评估单位时间内路网脆弱性的新方法:实时脆弱性指数(RVI)。通过使用上海高速公路的经验数据,研究了所提措施在实际交通场景中的实际应用。为防止交通拥堵,建议采用 RVI 临界值(RVI*)进行交通管制。此外,还进一步分析了交通状态相变过程中宏观基本图(MFD)和 RVI 的滞后性。结果表明,RVI 可以帮助实时推导出一些有代表性的交通特征,动态反映路网的脆弱性:当路网发生交通拥堵或事故时,MFD 和 RVI 上的交通滞后观察结果是一致的,RVI 更容易观察,更适合交通管理。研究结果证明,RVI 是帮助预测路网动态运行的可靠指标。
{"title":"Real-time Vulnerability Analysis of Urban Expressway","authors":"","doi":"10.1080/19427867.2023.2260972","DOIUrl":"10.1080/19427867.2023.2260972","url":null,"abstract":"<div><div>This study proposes a new method for evaluating the road network vulnerability per unit time: the real-time vulnerability index (RVI). The practical application of the proposed measure in real traffic scenarios is investigated by using empirical data from Shanghai Expressway.To prevent traffic congestion, a critical threshold of RVI (RVI*) is suggested for traffic control. Furthermore, the hysteresis on macroscopic fundamental diagram (MFD) and RVI is further analyzed in the phase transition of traffic states. The results show that RVI can help derive some representative traffic characteristics in real time and dynamically reflect road network vulnerability: when traffic congestion or accidents occur on the road network, the results observed for the traffic hysteresis on MFD and RVI were consistent, and RVI is easier to observe and more suitable for traffic management. The findings prove that RVI is a reliable indicator to help predict the dynamic operation of the road network.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 959-977"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136154153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analysis of the factors affecting the time spent on leisure activities by using an ordered logit model 利用有序对数模型分析影响休闲活动时间的因素
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2266189
The objective of the current study is to analyze the time spent on leisure activities in Budapest, considering five influencing factors. Data were collected from Google Popular Time (GPT) via location services using Python, resulting in a dataset of 1336 entries from July 2022. The analysis utilized the Ordered Logit Model (OLM). According to the outcomes, about 17% of visitors allocate significant time to leisure, while half spend relatively less. Leisure time is positively influenced by ratings and location but negatively affected by security levels. This study demonstrates the utility of GPT data for understanding individual behavior, offering valuable insights for decision-makers, tourism managers, and planners. Additionally, it sheds light on leisure-related traffic patterns, aiding in the identification of popular locations and peak time periods for leisure activities. This information can indirectly impact traffic flow in specific areas.
本研究的目的是分析布达佩斯休闲活动花费的时间,同时考虑五个影响因素。数据是通过使用 Python 的位置服务从谷歌大众时间(GPT)中收集的,数据集包含 2022 年 7 月的 1336 个条目。分析采用了有序对数模型(OLM)。结果显示,约有 17% 的游客将大量时间用于休闲,而一半游客的休闲时间相对较少。休闲时间受评分和地点的积极影响,但受安全级别的消极影响。这项研究证明了 GPT 数据在了解个人行为方面的实用性,为决策者、旅游管理者和规划者提供了宝贵的见解。此外,它还揭示了与休闲相关的交通模式,有助于确定休闲活动的热门地点和高峰时段。这些信息可间接影响特定区域的交通流量。
{"title":"Analysis of the factors affecting the time spent on leisure activities by using an ordered logit model","authors":"","doi":"10.1080/19427867.2023.2266189","DOIUrl":"10.1080/19427867.2023.2266189","url":null,"abstract":"<div><div>The objective of the current study is to analyze the time spent on leisure activities in Budapest, considering five influencing factors. Data were collected from Google Popular Time (GPT) via location services using Python, resulting in a dataset of 1336 entries from July 2022. The analysis utilized the Ordered Logit Model (OLM). According to the outcomes, about 17% of visitors allocate significant time to leisure, while half spend relatively less. Leisure time is positively influenced by ratings and location but negatively affected by security levels. This study demonstrates the utility of GPT data for understanding individual behavior, offering valuable insights for decision-makers, tourism managers, and planners. Additionally, it sheds light on leisure-related traffic patterns, aiding in the identification of popular locations and peak time periods for leisure activities. This information can indirectly impact traffic flow in specific areas.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1081-1090"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135096370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Spatio-temporal graph attention networks for traffic prediction 用于交通预测的时空图注意力网络
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-10-20 DOI: 10.1080/19427867.2023.2261706
The constraints of road network topology and dynamically changing traffic states over time make the task of traffic flow prediction extremely challenging. Most existing methods use CNNs or GCNs to capture spatial correlation. However, convolution operator-based methods are far from optimal in their ability to fuse node features and topology to adequately model spatial correlation. In order to model the spatio-temporal features of traffic flow more effectively, this paper proposes a traffic flow prediction model, the Spatio-Temporal Graph Attention Network (STGAN), which is based on graph attention mechanisms and residually connected gated recurrent units. Specifically, a graph attention mechanism and a random wandering mechanism are used to extract spatial features of the traffic network, and gated recurrent units with residual connections are used to extract temporal features. Experimental results on real-world public transportation datasets show that our approach not only yields state-of-the-art performance, but also exhibits competitive computational efficiency and improves the accuracy of traffic flow prediction.
路网拓扑结构的限制和随时间动态变化的交通状态使得交通流量预测任务极具挑战性。大多数现有方法都使用 CNN 或 GCN 来捕捉空间相关性。然而,基于卷积算子的方法在融合节点特征和拓扑结构以充分模拟空间相关性方面远未达到最佳效果。为了更有效地模拟交通流的时空特征,本文提出了一种基于图注意机制和残差连接门控递归单元的交通流预测模型--时空图注意网络(STGAN)。具体来说,图注意力机制和随机游走机制用于提取交通网络的空间特征,而具有残差连接的门控递归单元则用于提取时间特征。在现实世界公共交通数据集上的实验结果表明,我们的方法不仅能产生最先进的性能,还能展现出极具竞争力的计算效率,并提高交通流预测的准确性。
{"title":"Spatio-temporal graph attention networks for traffic prediction","authors":"","doi":"10.1080/19427867.2023.2261706","DOIUrl":"10.1080/19427867.2023.2261706","url":null,"abstract":"<div><div>The constraints of road network topology and dynamically changing traffic states over time make the task of traffic flow prediction extremely challenging. Most existing methods use CNNs or GCNs to capture spatial correlation. However, convolution operator-based methods are far from optimal in their ability to fuse node features and topology to adequately model spatial correlation. In order to model the spatio-temporal features of traffic flow more effectively, this paper proposes a traffic flow prediction model, the Spatio-Temporal Graph Attention Network (STGAN), which is based on graph attention mechanisms and residually connected gated recurrent units. Specifically, a graph attention mechanism and a random wandering mechanism are used to extract spatial features of the traffic network, and gated recurrent units with residual connections are used to extract temporal features. Experimental results on real-world public transportation datasets show that our approach not only yields state-of-the-art performance, but also exhibits competitive computational efficiency and improves the accuracy of traffic flow prediction.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 978-988"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136279553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Transportation Letters-The International Journal of Transportation Research
全部 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