发布求助
文献互助 智能选刊 最新文献

Transportmetrica B-Transport Dynamics最新文献

筛选
英文 中文
A conservative expected travel time approach for traffic information dissemination under uncertainty 不确定条件下交通信息传播的保守期望旅行时间方法
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-04-08 DOI: 10.1080/21680566.2022.2060369
Ruiya Chen, Xiangdong Xu, A. Chen, Chao Yang
{"title":"A conservative expected travel time approach for traffic information dissemination under uncertainty","authors":"Ruiya Chen, Xiangdong Xu, A. Chen, Chao Yang","doi":"10.1080/21680566.2022.2060369","DOIUrl":"https://doi.org/10.1080/21680566.2022.2060369","url":null,"abstract":"Travel time is important for both users and planners. Travel time variability widely exists in transportation systems. Positive skew with a long/fat upper tail is a basic characteristic of travel time variability, which poses great challenges to reporting travel time information to the public. There are two main approaches for disseminating travel time variability information: the traditional expected value and the percentile-based value. They are either unreliable when facing highly-skewed travel time variability, difficult to understand, or sensitive to individual risk preference. Motivated by this observation, this paper develops a conservative expected travel time (CET) approach to enhance the information reliability and maintain simplicity, which is formulated as a two-stage problem: (1) reshaping the travel time distribution, and (2) minimizing the expected value of the reshaped distribution. The features of the CET and the relationship between the CET and traditional measures are explored in both theoretical and numerical dimensions.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43490158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Optimization of multi-objective airport gate assignment problem: considering fairness between airlines 考虑航空公司公平性的多目标机场登机口分配优化问题
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-04-01 DOI: 10.1080/21680566.2022.2056542
Yu Jiang, Zhitao Hu, Zhenyu Liu, Honghai Zhang
{"title":"Optimization of multi-objective airport gate assignment problem: considering fairness between airlines","authors":"Yu Jiang, Zhitao Hu, Zhenyu Liu, Honghai Zhang","doi":"10.1080/21680566.2022.2056542","DOIUrl":"https://doi.org/10.1080/21680566.2022.2056542","url":null,"abstract":"The Airport Gate Assignment Problem (AGAP) deals with assigning a set of aircraft to the gates at airports with respect to several operational and commercial constraints. In this study, we model the AGAP as a multi-objective optimization problem that minimizes the aircraft taxiing costs and passenger walking distance. An additional consideration is taken regarding the fairness of assignment among different airlines. To solve this problem, we propose the NSGA-II-LNS algorithm which builds upon the NSGA-II framework and incorporates the advantages of Large Neighborhood Search (LNS) for refining the solution quality. Two search operators are designed within LNS tailored to different senses of fairness coefficients. A numerical study at Nanjing Lukou International Airport indicates that the proposed algorithm significantly outperforms the previously published algorithms in terms of both solution convergence and diversity. Moreover, acceptable computing time implies the practical potential of our model.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42120276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Robust collaborative optimization for train timetabling and short-turning strategy in urban rail transit systems 城市轨道交通系统列车调度与短时转向策略的鲁棒协同优化
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-03-14 DOI: 10.1080/21680566.2022.2048120
Ling Zhu, Shukai Li, Yuting Hu, Bin Jia
{"title":"Robust collaborative optimization for train timetabling and short-turning strategy in urban rail transit systems","authors":"Ling Zhu, Shukai Li, Yuting Hu, Bin Jia","doi":"10.1080/21680566.2022.2048120","DOIUrl":"https://doi.org/10.1080/21680566.2022.2048120","url":null,"abstract":"This paper investigates the robust collaborative train timetabling optimization problem by integrating short-turning strategy and train circulation plan while considering the uncertainty in passenger demand. The passenger dynamics equations are proposed to represent the relationship among headways, short-turning services, and passenger load. A mixed-integer nonlinear programming (MINLP) model is constructed to balance train utilization and stranded passengers. The extra variables are introduced to linearize the nonlinear constraints and convert the original model into a robust counterpart model according to the strong duality theory. Finally, two numerical experiments are carried out to verify the validity of the train timetabling model integrating with short-turning strategies. The study shows that the proposed strategy can better support the balance between stranded passengers and train utilization compared to other regular strategies. Moreover, the results indicate that robust strategies perform well in the trade-off between the optimality and the level of conservatism of the solutions.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47430242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Integrated optimization of train route plan and timetable with dynamic demand for the urban rail transit line 城市轨道交通线路动态需求下的列车路线规划与时刻表综合优化
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-03-01 DOI: 10.1080/21680566.2022.2040064
Ruixia Yang, B. Han, Qi Zhang, Zhenyu Han, Yuxuan Long
{"title":"Integrated optimization of train route plan and timetable with dynamic demand for the urban rail transit line","authors":"Ruixia Yang, B. Han, Qi Zhang, Zhenyu Han, Yuxuan Long","doi":"10.1080/21680566.2022.2040064","DOIUrl":"https://doi.org/10.1080/21680566.2022.2040064","url":null,"abstract":"ABSTRACT In the urban rail transit system, train timetabling according to the dynamic passenger demand is important to offer high-quality service. Timetable optimization with the predetermined train route plan cannot synchronously consider the spatial and temporal characteristics of demand. Based on the Automated Fare Collection (AFC) data, this study proposes the integrated optimization (IO) to make route plan and timetable. A mixed-integer nonlinear programming (MINLP) model is formulated with the aim of reducing passenger penalty travel time and operation penalty cost. An improved non-dominated sorted genetic algorithm-II (Improved NSGA-II) is applied to deal with the bi-objective problem. A numerical experiment is used to prove the effectiveness and efficiency of the model and the algorithm. Then, the IO approach is applied in a bi-directional urban rail transit line. The results show that the IO performs the best compared with two other feasible strategies, namely the current optimization (CO) and phased optimization (PO).","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43688366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Recalibration of the BPR function for the strategic modelling of connected and autonomous vehicles 为联网和自动驾驶汽车的战略建模重新校准BPR功能
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-02-28 DOI: 10.1080/21680566.2022.2040063
Esta Qiu, Navreet Virdi, H. Grzybowska, Travis Waller
{"title":"Recalibration of the BPR function for the strategic modelling of connected and autonomous vehicles","authors":"Esta Qiu, Navreet Virdi, H. Grzybowska, Travis Waller","doi":"10.1080/21680566.2022.2040063","DOIUrl":"https://doi.org/10.1080/21680566.2022.2040063","url":null,"abstract":"This paper assesses the adequacy of the BPR volume delay function for the strategic modelling of Connected and Autonomous Vehicles (CAVs). Three testbed environments are simulated at 10% increments of CAV penetration rates (CPR) to observe network performance in mixed fleet environments. The microsimulation dataset is compared with the BPR travel time predictions to evaluate the need for recalibration. Where appropriate, the BPR modelling parameters are redefined as a function of the CPR. The predictive quality of the recalibrated model is then validated by comparing it against the BPR function on synthetic data. The numerical results indicate an overall improvement in travel time prediction using the recalibrated model, with a significant reduction in root mean square error from 15.16 to 8.86. The recalibrated model also outperformed the traditional BPR model in 67% of the 4620 cases used for validation, and better-predicted travel time by 5.43 times.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":"10 1","pages":"779 - 800"},"PeriodicalIF":2.8,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43708260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
First train timetable synchronization with interval trains in subway networks 地铁网络中首列车时刻表与区间列车的同步
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-02-25 DOI: 10.1080/21680566.2022.2038304
Yu-Zhang Chen, Cong-Ling Shi, C. Claudel, Maobin Hu
{"title":"First train timetable synchronization with interval trains in subway networks","authors":"Yu-Zhang Chen, Cong-Ling Shi, C. Claudel, Maobin Hu","doi":"10.1080/21680566.2022.2038304","DOIUrl":"https://doi.org/10.1080/21680566.2022.2038304","url":null,"abstract":"As the subway system is beginning to operate interval trains in the early morning, it is necessary to discuss the first train timetable synchronization with interval trains. In this paper, with the consideration of both ordinary trains and interval trains, we study the first train timetable problem with minimum total transfer waiting time. The first train timetable model is formulated as a mixed integer programming problem and a genetic simulated annealing algorithm is developed to deal with the case study of Beijing subway network. The proposed model and the algorithm are effective in improving the performance of the first train timetable synchronization. After optimization, the total transfer waiting time and the number of long waiting time transfer directions for Beijing subway network have decreased significantly. The results indicate that operating interval trains is an effective way to solve the problem of long waiting time in early morning.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42475314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A detection method for cyber-attack on connected signal phase and timing information 一种基于连通信号相位和时序信息的网络攻击检测方法
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-02-23 DOI: 10.1080/21680566.2022.2039323
Jia Hu, Longqian Qi, Zihan Zhang, X. Yang, Haoran Wang, Xin Li
{"title":"A detection method for cyber-attack on connected signal phase and timing information","authors":"Jia Hu, Longqian Qi, Zihan Zhang, X. Yang, Haoran Wang, Xin Li","doi":"10.1080/21680566.2022.2039323","DOIUrl":"https://doi.org/10.1080/21680566.2022.2039323","url":null,"abstract":"This paper proposes a method to detect cyber-attacks by cross-checking Signal Phase and Timing (SPaT) information and connected vehicle trajectories data. The proposed method is only applicable to cyber-attacks that involve information tempering. The proposed V2I cyber-attacks detection algorithm includes the following features: i) effective in detecting the authenticity of broad-casted SPaT information; ii) feasible to identify the occurrence of cyber-attacks when the defensive function fails; iii) functional in the environment of partially connected and automated traffic; iv) leveraging transportation knowledge for cybersecurity assurance. Furthermore, a sensitivity analysis on the connected vehicle penetration rate is conducted. The best performance is observed when the penetration rate is 100%. Under this penetration rate, the experimental result demonstrates that the accuracy rate of the proposed method reached 94%.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":"10 1","pages":"731 - 751"},"PeriodicalIF":2.8,"publicationDate":"2022-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43860516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Relaxation methods for fixed route demand responsive transit 固定路线需求响应公交的放松方法
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-02-22 DOI: 10.1080/21680566.2022.2039800
Oksana Pecherski Sabinik, H. Bar-Gera
{"title":"Relaxation methods for fixed route demand responsive transit","authors":"Oksana Pecherski Sabinik, H. Bar-Gera","doi":"10.1080/21680566.2022.2039800","DOIUrl":"https://doi.org/10.1080/21680566.2022.2039800","url":null,"abstract":"This article examines a partially responsive ride-sharing transit service with predetermined cyclic routes and deterministic travel times. The main operational challenge is setting the time schedule, which varies from day to day in response to upfront passenger requests. The need of passengers to adjust their departure times from their desired value causes inconvenience, which we wish to minimize. A previous study of the fixed route dial a ride problem (FRDARP) considered strict fleet constraints. We solve two relaxed formulations, related to the one-dimensional p-median location problem, by efficient dynamic programming embedding the SMAWK algorithm. Numerical results show the potential benefit of the FRDARP compared to fixed schedule (traditional) service and illustrate the impact of demand level and fleet constraints. In addition, based on these results, we characterize the wide range of scenarios where an easier to solve relaxed formulation can be nearly as useful as the constrained formulation.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":"10 1","pages":"752 - 778"},"PeriodicalIF":2.8,"publicationDate":"2022-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44200050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-lane-merging strategy for connected automated vehicles on freeway ramps 高速公路匝道上连接自动车辆的多车道并线策略
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-02-19 DOI: 10.1080/21680566.2022.2041503
Xiaoling Luo, Xiaofen Li, Mohammad Razaur Rahman Shaon, Yongxiang Zhang
{"title":"Multi-lane-merging strategy for connected automated vehicles on freeway ramps","authors":"Xiaoling Luo, Xiaofen Li, Mohammad Razaur Rahman Shaon, Yongxiang Zhang","doi":"10.1080/21680566.2022.2041503","DOIUrl":"https://doi.org/10.1080/21680566.2022.2041503","url":null,"abstract":"Most studies assume the ramp to be a single lane regardless of the possibility of multiple lanes on a freeway ramp. This assumption limits the application of previous ramp metering strategies in the real world. Therefore, this paper proposes a strategy for a centralized controller to efficiently merge connected automated vehicles from a multiple-lane ramp. The proposed strategy aims to allow vehicles from different lanes to pass through the conflict point with the objective of minimum delay and fuel consumption. Numerical experiments are carried out to compare the proposed strategy with first-in-first-out (FIFO) and Vissim built-in strategies. Simulation results indicate that the proposed strategy can reduce more delay than FIFO and Vissim-based strategies. Furthermore, the proposed strategy is also found to be the most reliable in various scenarios with different traffic demand splits, safe headways, and numbers of lanes.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46009055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Optimising Gate assignment and taxiway path in a discrete time–space network: integrated model and state analysis 离散时空网络中登机口分配与滑行道路径优化:综合模型与状态分析
IF 2.8 2区 工程技术
Transportmetrica B-Transport Dynamics Pub Date : 2022-02-16 DOI: 10.1080/21680566.2022.2036650
Jiaming Liu, Zhen Guo, B. Yu
{"title":"Optimising Gate assignment and taxiway path in a discrete time–space network: integrated model and state analysis","authors":"Jiaming Liu, Zhen Guo, B. Yu","doi":"10.1080/21680566.2022.2036650","DOIUrl":"https://doi.org/10.1080/21680566.2022.2036650","url":null,"abstract":"Airside ground traffic faces increasing congestion pressure with the rapid growth of world air transportation. Airside ground operations, such as gate assignment and taxiway planning, demonstrate excellent results from their own point of view in academia, while the integrated operations are seldom considered. In this paper, we propose an integrated model in a discrete time–space network to simultaneously deal with gate assignment and taxiway planning. An integer programming based on the multi-commodity flow form is formulated to bridge two problems. Practical constraints of the taxiway conflict and gate operation are considered. We also conduct a state analysis among the integrated model, first-come-first-served (FCFS) method, and heuristic approach. The results show that the integrated model can balance the resources between gates and taxiing paths. Sensitivity analyses reveal that the number of flight pairs and connect time impacts gate idle time and aircraft taxi time by directly changing gate assignment.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43627387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信