Pub Date : 2023-03-02DOI: 10.1080/21680566.2023.2185497
Wenbo Du, Shaochuan Zhu, L. Tong, Kaiquan Cai, Zhe Liang
Robust gate assignment problem (RGAP) aims to generate a reliable schedule that reduces the occurrence of potential gate conflicts under stochastic flight delays. Although allocating buffer time in the gate schedules is widely adopted to absorb the delay disturbances, the relation between the schedule robustness and the aircraft delay heterogeneity has not yet been well explored. To allocate the buffer optimally, we analyse the heterogeneity of gate conflict and propose two new robustness measurements to quantify the number of potential conflicts from the expectation perspective. Then the RGAP is modelled as a set-covering problem to simultaneously optimise the expected conflict cost and basic operating cost. To solve the model efficiently, we develop a column generation-based heuristic (CDBH) to find high-quality solutions. Computational studies based on Shenzhen Baoan International Airport reveal that the proposed measurements considering the delay heterogeneity can significantly improve the robustness of gate schedules.
{"title":"Robust gate assignment to minimise aircraft conflicts","authors":"Wenbo Du, Shaochuan Zhu, L. Tong, Kaiquan Cai, Zhe Liang","doi":"10.1080/21680566.2023.2185497","DOIUrl":"https://doi.org/10.1080/21680566.2023.2185497","url":null,"abstract":"Robust gate assignment problem (RGAP) aims to generate a reliable schedule that reduces the occurrence of potential gate conflicts under stochastic flight delays. Although allocating buffer time in the gate schedules is widely adopted to absorb the delay disturbances, the relation between the schedule robustness and the aircraft delay heterogeneity has not yet been well explored. To allocate the buffer optimally, we analyse the heterogeneity of gate conflict and propose two new robustness measurements to quantify the number of potential conflicts from the expectation perspective. Then the RGAP is modelled as a set-covering problem to simultaneously optimise the expected conflict cost and basic operating cost. To solve the model efficiently, we develop a column generation-based heuristic (CDBH) to find high-quality solutions. Computational studies based on Shenzhen Baoan International Airport reveal that the proposed measurements considering the delay heterogeneity can significantly improve the robustness of gate schedules.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49185079","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}
Pub Date : 2023-01-20DOI: 10.1080/21680566.2023.2165191
Jiarong Yao, Hao Wu, Keshuang Tang
Signal phase and timing (SPaT) information is a necessary input for traffic performance evaluation. However, current SPaT estimation studies mainly focus on estimation of cycle length or green time of a certain movement, and are realized mostly by floating car data whose data quality significantly affects the estimation accuracy. As license plate recognition (LPR) systems are becoming a widely implemented and reliable data source in China, in this study, a SPaT estimation method is proposed using the LPR data for fixed-time controlled intersections. The SPaT estimation problem is formulated as a bi-level programming model to find the optimal match between the phase boundaries and the LPR passing time series in the study period. Evaluation is done with an empirical case and compared with an existing method, results show that the estimation accuracies of the phase duration can reach 90.0%, outperforming the existing method and demonstrating great potential for practical application.
{"title":"A bi-Level programming method for SPaT estimation at fixed-time controlled intersections using license plate recognition data","authors":"Jiarong Yao, Hao Wu, Keshuang Tang","doi":"10.1080/21680566.2023.2165191","DOIUrl":"https://doi.org/10.1080/21680566.2023.2165191","url":null,"abstract":"Signal phase and timing (SPaT) information is a necessary input for traffic performance evaluation. However, current SPaT estimation studies mainly focus on estimation of cycle length or green time of a certain movement, and are realized mostly by floating car data whose data quality significantly affects the estimation accuracy. As license plate recognition (LPR) systems are becoming a widely implemented and reliable data source in China, in this study, a SPaT estimation method is proposed using the LPR data for fixed-time controlled intersections. The SPaT estimation problem is formulated as a bi-level programming model to find the optimal match between the phase boundaries and the LPR passing time series in the study period. Evaluation is done with an empirical case and compared with an existing method, results show that the estimation accuracies of the phase duration can reach 90.0%, outperforming the existing method and demonstrating great potential for practical application.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45098765","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}
Pub Date : 2023-01-12DOI: 10.1080/21680566.2023.2165192
Wenxin Teng, B. Chen, W. Lam, Weishu Gong, Chaoyang Shi, M. Tam
Eco-routing aims to provide fuel-efficient paths to help travellers make route choice decisions in the road network. Most eco-routing algorithms build on a deterministic assumption about link fuel consumption. However, link fuel consumption in real road networks is highly stochastic caused by travel speed variations. This study investigates the eco-routing problem by explicitly considering uncertainties of travel time and fuel consumption. A stochastic fuel consumption formula to estimate fuel consumption distributions caused by travel speed variations is proposed. A bi-objective reliable eco-routing model is developed by minimizing the travel time budget and fuel consumption budget simultaneously while satisfying given constraints on travel time reliability and fuel consumption reliability. An efficient reliable path ranking algorithm is developed to solve the formulated model exactly. A comprehensive case study using real data from Hong Kong is presented to demonstrate the applicability of the proposed model and algorithm.
{"title":"Bi-objective reliable eco-routing considering uncertainties of travel time and fuel consumption","authors":"Wenxin Teng, B. Chen, W. Lam, Weishu Gong, Chaoyang Shi, M. Tam","doi":"10.1080/21680566.2023.2165192","DOIUrl":"https://doi.org/10.1080/21680566.2023.2165192","url":null,"abstract":"Eco-routing aims to provide fuel-efficient paths to help travellers make route choice decisions in the road network. Most eco-routing algorithms build on a deterministic assumption about link fuel consumption. However, link fuel consumption in real road networks is highly stochastic caused by travel speed variations. This study investigates the eco-routing problem by explicitly considering uncertainties of travel time and fuel consumption. A stochastic fuel consumption formula to estimate fuel consumption distributions caused by travel speed variations is proposed. A bi-objective reliable eco-routing model is developed by minimizing the travel time budget and fuel consumption budget simultaneously while satisfying given constraints on travel time reliability and fuel consumption reliability. An efficient reliable path ranking algorithm is developed to solve the formulated model exactly. A comprehensive case study using real data from Hong Kong is presented to demonstrate the applicability of the proposed model and algorithm.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41994805","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}
Pub Date : 2023-01-12DOI: 10.1080/21680566.2022.2164529
Douglas Zechin, H. Cybis
This paper proposes a framework for short-term traffic breakdown probability calculation using a Variational LSTM neural network model. Considering that traffic breakdown is a stochastic event, this forecast framework was devised to produce distributions as outputs, which cannot be achieved using standard deterministic recurrent neural networks. Therefore, the model counts on the robustness of neural networks but also includes the stochastic characteristics of highway capacity. The framework consists of three main steps: (i) build and train a probabilistic speed forecasting neural network, (ii) forecast speed distributions with the trained model using Monte Carlo (MC) dropout, and therefore perform Bayesian approximation, and (iii) establish a speed threshold that characterizes breakdown occurrence and calculate breakdown probabilities based on the speed distributions. The proposed framework produced an efficient control over traffic breakdown occurrence, can deal with many independent variables or features, and can be combined with traffic management strategies.
{"title":"Probabilistic traffic breakdown forecasting through Bayesian approximation using variational LSTMs","authors":"Douglas Zechin, H. Cybis","doi":"10.1080/21680566.2022.2164529","DOIUrl":"https://doi.org/10.1080/21680566.2022.2164529","url":null,"abstract":"This paper proposes a framework for short-term traffic breakdown probability calculation using a Variational LSTM neural network model. Considering that traffic breakdown is a stochastic event, this forecast framework was devised to produce distributions as outputs, which cannot be achieved using standard deterministic recurrent neural networks. Therefore, the model counts on the robustness of neural networks but also includes the stochastic characteristics of highway capacity. The framework consists of three main steps: (i) build and train a probabilistic speed forecasting neural network, (ii) forecast speed distributions with the trained model using Monte Carlo (MC) dropout, and therefore perform Bayesian approximation, and (iii) establish a speed threshold that characterizes breakdown occurrence and calculate breakdown probabilities based on the speed distributions. The proposed framework produced an efficient control over traffic breakdown occurrence, can deal with many independent variables or features, and can be combined with traffic management strategies.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49449398","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}
Pub Date : 2022-12-31DOI: 10.1080/21680566.2022.2025951
Fuya Yuan, Huijun Sun, Liujiang Kang, Si Zhang
Focusing on massive demand and high-frequency trains in urban rail transit, this paper proposes a novel joint optimization approach for train scheduling and dynamic passenger flow control strategy under oversaturated conditions to minimize the total number of waiting passengers. In view of the relationship between the number of boarding/alighting passengers and the dwell time of trains, the problem is formulated as a mixed-integer linear programming (MILP) model. This model can achieve the trade-off between the utilization of trains and passengers. The ILOG CPLEX is adopted to solve the proposed model. And a real-world case study of the Beijing Metro Line 5 is given to demonstrate the feasibility and effectiveness. Through jointly optimizing train schedule and flow control, the average boarding rate of passengers increases from 36.34% to 87.55%. The results show that the proposed flow control is effective in alleviating the oversaturated situations at platforms and trains.
{"title":"Joint optimization of train scheduling and dynamic passenger flow control strategy with headway-dependent demand","authors":"Fuya Yuan, Huijun Sun, Liujiang Kang, Si Zhang","doi":"10.1080/21680566.2022.2025951","DOIUrl":"https://doi.org/10.1080/21680566.2022.2025951","url":null,"abstract":"Focusing on massive demand and high-frequency trains in urban rail transit, this paper proposes a novel joint optimization approach for train scheduling and dynamic passenger flow control strategy under oversaturated conditions to minimize the total number of waiting passengers. In view of the relationship between the number of boarding/alighting passengers and the dwell time of trains, the problem is formulated as a mixed-integer linear programming (MILP) model. This model can achieve the trade-off between the utilization of trains and passengers. The ILOG CPLEX is adopted to solve the proposed model. And a real-world case study of the Beijing Metro Line 5 is given to demonstrate the feasibility and effectiveness. Through jointly optimizing train schedule and flow control, the average boarding rate of passengers increases from 36.34% to 87.55%. The results show that the proposed flow control is effective in alleviating the oversaturated situations at platforms and trains.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":"10 1","pages":"627 - 651"},"PeriodicalIF":2.8,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45412582","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}
Pub Date : 2022-12-31DOI: 10.1080/21680566.2021.1989079
Fang Zong, Zhengbing He, Meng Zeng, Yixuan Liu
This paper presents a multi-agent dynamic lane-changing (LC) trajectory planning method for CAV. In this method, a decision module is constructed by means of a potential field to determine the LC starting point. Then a series of trajectories is generated in the trajectory generation module. A cost function is constructed for searching for the corresponding optimal trajectory for both the subject vehicle and the participants. The simulation results indicate that the proposed model improves the LC success rate and reduces duration. Differing from the traditional model, we consider the cooperation feature of CAV’s LC and satisfy the subject vehicle’s demand as well as minimizing its impact on the other participants. Moreover, the driving environment including mesoscale information is considered to improve the LC success rate, which provides a new strategy for optimizing LC decision. Additionally, the method can also be applied to simulate CAVs’ LC behaviour.
{"title":"Dynamic lane changing trajectory planning for CAV: A multi-agent model with path preplanning","authors":"Fang Zong, Zhengbing He, Meng Zeng, Yixuan Liu","doi":"10.1080/21680566.2021.1989079","DOIUrl":"https://doi.org/10.1080/21680566.2021.1989079","url":null,"abstract":"This paper presents a multi-agent dynamic lane-changing (LC) trajectory planning method for CAV. In this method, a decision module is constructed by means of a potential field to determine the LC starting point. Then a series of trajectories is generated in the trajectory generation module. A cost function is constructed for searching for the corresponding optimal trajectory for both the subject vehicle and the participants. The simulation results indicate that the proposed model improves the LC success rate and reduces duration. Differing from the traditional model, we consider the cooperation feature of CAV’s LC and satisfy the subject vehicle’s demand as well as minimizing its impact on the other participants. Moreover, the driving environment including mesoscale information is considered to improve the LC success rate, which provides a new strategy for optimizing LC decision. Additionally, the method can also be applied to simulate CAVs’ LC behaviour.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":"10 1","pages":"266 - 292"},"PeriodicalIF":2.8,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47957816","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}
Pub Date : 2022-12-12DOI: 10.1080/21680566.2022.2154717
Ang Ji, M. Ramezani, David Levinson
This study models a lane-changing event as two behaviourally interconnected phases: ‘stay’ and ‘execution’. The model considers the ‘stay’ phase duration stochastically depending on external traffic conditions. The ‘execution’ phase is modelled as the longitudinal speed profile deployed to perform the lane change. The model comprises a Bayesian survival analysis to predict the probability of the stay duration before a new ‘execution’ phase while tackling the censoring issue of survival methods. Using naturalistic vehicular trajectory data, this paper quantifies what factors influence driver behaviour in lane-keeping and lane-changing execution. The parameter estimation results demonstrate that drivers' decisions on phase transitions are influenced by surrounding conditions, lane-changing purpose, directions, and departure lanes. The findings reveal that urgency (stemming from the purpose) and patience (satisfaction with the existing situation) are the main reasons for leaving the current lane. Adequate distances and relative speeds compared with surrounding vehicles induce or dissuade acceleration behaviour during the execution phase.
{"title":"Joint modelling of longitudinal and lateral dynamics in lane-changing maneuvers","authors":"Ang Ji, M. Ramezani, David Levinson","doi":"10.1080/21680566.2022.2154717","DOIUrl":"https://doi.org/10.1080/21680566.2022.2154717","url":null,"abstract":"This study models a lane-changing event as two behaviourally interconnected phases: ‘stay’ and ‘execution’. The model considers the ‘stay’ phase duration stochastically depending on external traffic conditions. The ‘execution’ phase is modelled as the longitudinal speed profile deployed to perform the lane change. The model comprises a Bayesian survival analysis to predict the probability of the stay duration before a new ‘execution’ phase while tackling the censoring issue of survival methods. Using naturalistic vehicular trajectory data, this paper quantifies what factors influence driver behaviour in lane-keeping and lane-changing execution. The parameter estimation results demonstrate that drivers' decisions on phase transitions are influenced by surrounding conditions, lane-changing purpose, directions, and departure lanes. The findings reveal that urgency (stemming from the purpose) and patience (satisfaction with the existing situation) are the main reasons for leaving the current lane. Adequate distances and relative speeds compared with surrounding vehicles induce or dissuade acceleration behaviour during the execution phase.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49431694","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}
Pub Date : 2022-12-12DOI: 10.1080/21680566.2022.2154288
Jiali Peng, W. Shangguan, Linguo Chai
Heterogeneous traffic agents consisting of human-driven vehicle (HDV) and connected-automated vehicle (CAV) appear on the road and form a mixed traffic environment. When combining the characteristics of CAVs and HDVs, it's still an open issue of investigating how heterogeneous traffic agents will execute lane-changing. With respect to the coupling process in the lane-changing behaviour of vehicles, this paper derives the lane changing optimization method for CAVs under different penetration rates. This method captures not only the full spectrum of CAV penetration rates but also all types of vehicle platoon. Firstly, the different car-following and lane-changing models are used to capture the characteristics of different types of vehicles. Moreover, For CAV, the Cooperative Adaptive Cruise Control (CACC) vehicle would degrade into the Adaptive Cruise Control (ACC) vehicle due to communication failure. Secondly, the framework for the coupling analysis of CAV lane-changing behaviour and mixed traffic stability is derived. Then, this study proposes and examines optimal control strategies based on numerical simulation. These consist of a longitudinal phase, in which the proposed strategies improve the operational efficiency of the overall mixed traffic flow, and a lateral phase, in which they safely change lanes. The results show that they improve the comfort, efficiency, safety, and stability of the heterogeneous traffic agents compared to the maneuvers performed by the baseline. This method can serve as a useful and simple decision tool for future CAV lane management.
{"title":"Strategy of lane-changing coupling process for connected and automated vehicles in mixed traffic environment","authors":"Jiali Peng, W. Shangguan, Linguo Chai","doi":"10.1080/21680566.2022.2154288","DOIUrl":"https://doi.org/10.1080/21680566.2022.2154288","url":null,"abstract":"Heterogeneous traffic agents consisting of human-driven vehicle (HDV) and connected-automated vehicle (CAV) appear on the road and form a mixed traffic environment. When combining the characteristics of CAVs and HDVs, it's still an open issue of investigating how heterogeneous traffic agents will execute lane-changing. With respect to the coupling process in the lane-changing behaviour of vehicles, this paper derives the lane changing optimization method for CAVs under different penetration rates. This method captures not only the full spectrum of CAV penetration rates but also all types of vehicle platoon. Firstly, the different car-following and lane-changing models are used to capture the characteristics of different types of vehicles. Moreover, For CAV, the Cooperative Adaptive Cruise Control (CACC) vehicle would degrade into the Adaptive Cruise Control (ACC) vehicle due to communication failure. Secondly, the framework for the coupling analysis of CAV lane-changing behaviour and mixed traffic stability is derived. Then, this study proposes and examines optimal control strategies based on numerical simulation. These consist of a longitudinal phase, in which the proposed strategies improve the operational efficiency of the overall mixed traffic flow, and a lateral phase, in which they safely change lanes. The results show that they improve the comfort, efficiency, safety, and stability of the heterogeneous traffic agents compared to the maneuvers performed by the baseline. This method can serve as a useful and simple decision tool for future CAV lane management.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42424292","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}
Pub Date : 2022-12-05DOI: 10.1080/21680566.2022.2152129
Kequan Chen, V. Knoop, Pan-xue Liu, Zhibin Li, Yuxuan Wang
The pre-insertion process called anticipation is an essential component of a lane-changing manoeuvre. There is little empirical research regarding the impact of anticipation. Thus, this paper aims to explore the behaviour of the new follower (NF) in the target lane when it encounters anticipation by using new trajectory datasets. The changing magnitude of the reaction pattern is proposed to identify the NF’s behaviour. We find that the anticipation significantly affects the NF’s movement in terms of gap creation and speed reduction. Then, we conduct a detailed analysis of critical variables to reveal their relationship with the NF’s behaviour. Following this, we develop binary logistic models to predict the NF’s behaviour, resulting in a good performance. It also suggests that the NF’s behaviour is highly related to the anticipation-related variables. The transferability test results show that this model can be directly used in different locations and times with satisfactory accuracy.
{"title":"How gaps are created during anticipation of lane changes","authors":"Kequan Chen, V. Knoop, Pan-xue Liu, Zhibin Li, Yuxuan Wang","doi":"10.1080/21680566.2022.2152129","DOIUrl":"https://doi.org/10.1080/21680566.2022.2152129","url":null,"abstract":"The pre-insertion process called anticipation is an essential component of a lane-changing manoeuvre. There is little empirical research regarding the impact of anticipation. Thus, this paper aims to explore the behaviour of the new follower (NF) in the target lane when it encounters anticipation by using new trajectory datasets. The changing magnitude of the reaction pattern is proposed to identify the NF’s behaviour. We find that the anticipation significantly affects the NF’s movement in terms of gap creation and speed reduction. Then, we conduct a detailed analysis of critical variables to reveal their relationship with the NF’s behaviour. Following this, we develop binary logistic models to predict the NF’s behaviour, resulting in a good performance. It also suggests that the NF’s behaviour is highly related to the anticipation-related variables. The transferability test results show that this model can be directly used in different locations and times with satisfactory accuracy.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42549435","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}
Drivers could be more careful when vehicles move in the non-standard narrow lane. This might cause the drivers to behave differently from other normal-size lanes. To investigate the characteristics of the traffic flow in narrow lanes, this paper collected the vehicle trajectory data on four-lane road segments with 2.8m width and 3.25m width respectively. Firstly, the spatial distribution of wheel tracks in the lane under low traffic volume is studied, and the results show that the wheel trails’ distribution is obviously affected by three factors: speed, lane width, and lane in cross-section position, which are significantly different from normal-size lanes. Secondly, statistical analysis shows that vehicle-following status in narrow lane environment can be divided into three types: staggered following, parallel following, and transitional following. Finally, a multivariate logistic regression model is constructed to predict the driver’s following strategy under different driving micro-environment parameters. The research results can support the fine management of lanes and help to improve the driving strategy of autonomous vehicles.
{"title":"Research on vehicle driving characteristics in narrow lanes based on different vehicle-following states","authors":"Baorui Han, Ruitong Zhu, Ren Dong, Mengfan Zhang, Wanlu Song, Zhenjun Zhu","doi":"10.1080/21680566.2022.2146776","DOIUrl":"https://doi.org/10.1080/21680566.2022.2146776","url":null,"abstract":"Drivers could be more careful when vehicles move in the non-standard narrow lane. This might cause the drivers to behave differently from other normal-size lanes. To investigate the characteristics of the traffic flow in narrow lanes, this paper collected the vehicle trajectory data on four-lane road segments with 2.8m width and 3.25m width respectively. Firstly, the spatial distribution of wheel tracks in the lane under low traffic volume is studied, and the results show that the wheel trails’ distribution is obviously affected by three factors: speed, lane width, and lane in cross-section position, which are significantly different from normal-size lanes. Secondly, statistical analysis shows that vehicle-following status in narrow lane environment can be divided into three types: staggered following, parallel following, and transitional following. Finally, a multivariate logistic regression model is constructed to predict the driver’s following strategy under different driving micro-environment parameters. The research results can support the fine management of lanes and help to improve the driving strategy of autonomous vehicles.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44655657","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：