Pub Date : 2022-08-30DOI: 10.1080/21680566.2022.2116125
Tao Jia, Chenxi Cai
Prediction of short-term traffic flow has been examined recently, but little attention has been paid to the prediction of citywide turning traffic flow at intersections. Based on an in-depth analysis of turning traffic flow patterns, we propose a novel attention-based spatiotemporal deep learning model to predict citywide short-term turning traffic flow at road intersections with high accuracy. First, we examine the spatiotemporal patterns of turning traffic flow. Then, an end-to-end deep learning structure with four components is designed to model turning traffic flow. In our model, graph convolutional network is revised to learn spatial dependencies and sparseness, and gate recurrent unit network with an attention mechanism is developed to learn temporal dependencies and fluctuations. Experiments were conducted in Wuhan, China, where taxicab trajectory data were used to train and validate our model. The results suggest that our model outperforms current state-of-the-art models with higher accuracy on estimating turning traffic flow.
{"title":"Forecasting citywide short-term turning traffic flow at intersections using an attention-based spatiotemporal deep learning model","authors":"Tao Jia, Chenxi Cai","doi":"10.1080/21680566.2022.2116125","DOIUrl":"https://doi.org/10.1080/21680566.2022.2116125","url":null,"abstract":"Prediction of short-term traffic flow has been examined recently, but little attention has been paid to the prediction of citywide turning traffic flow at intersections. Based on an in-depth analysis of turning traffic flow patterns, we propose a novel attention-based spatiotemporal deep learning model to predict citywide short-term turning traffic flow at road intersections with high accuracy. First, we examine the spatiotemporal patterns of turning traffic flow. Then, an end-to-end deep learning structure with four components is designed to model turning traffic flow. In our model, graph convolutional network is revised to learn spatial dependencies and sparseness, and gate recurrent unit network with an attention mechanism is developed to learn temporal dependencies and fluctuations. Experiments were conducted in Wuhan, China, where taxicab trajectory data were used to train and validate our model. The results suggest that our model outperforms current state-of-the-art models with higher accuracy on estimating turning traffic flow.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48289675","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-08-19DOI: 10.1080/21680566.2022.2113176
Chuanyao Li, Yichao Lu, Gege Jiang, Qijia Sun
The staggered shifts scheme has been widely discussed to alleviate traffic congestion in recent years. However, most previous research considers limited numbers of work start times and ignores the dynamic characteristics of traffic flow. In this paper, we consider a linear staggered shifts (LSS) scheme, which assumes the work start times for commuters is a continuous time period, to replace the identical work start time in a single-entry traffic corridor. We analytically derive the social optimal (SO) assignment and find the optimal LSS scheme in the flow congestion model with no late arrivals. The evolvement laws of traffic flow in the time–space dimension and corresponding economic properties with the optimal LSS scheme are also investigated. Results demonstrate that the application of the proposed optimal LSS scheme will not change the flow pattern of commuters in SO but significantly reduce the total trip cost.
{"title":"Social optimum for linear staggered shifts in a single-entry traffic corridor with no late arrivals","authors":"Chuanyao Li, Yichao Lu, Gege Jiang, Qijia Sun","doi":"10.1080/21680566.2022.2113176","DOIUrl":"https://doi.org/10.1080/21680566.2022.2113176","url":null,"abstract":"The staggered shifts scheme has been widely discussed to alleviate traffic congestion in recent years. However, most previous research considers limited numbers of work start times and ignores the dynamic characteristics of traffic flow. In this paper, we consider a linear staggered shifts (LSS) scheme, which assumes the work start times for commuters is a continuous time period, to replace the identical work start time in a single-entry traffic corridor. We analytically derive the social optimal (SO) assignment and find the optimal LSS scheme in the flow congestion model with no late arrivals. The evolvement laws of traffic flow in the time–space dimension and corresponding economic properties with the optimal LSS scheme are also investigated. Results demonstrate that the application of the proposed optimal LSS scheme will not change the flow pattern of commuters in SO but significantly reduce the total trip cost.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46235098","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-08-16DOI: 10.1080/21680566.2022.2111377
S. Pravinvongvuth, Imalka C. Matarage
This research aims to propose a new form of transportation network, the Chet network, to facilitate vehicular flow within a new area of built environment. One- and two-way links are uniquely arranged to form hexagonal blocks, such that vehicles can move from one place to another without facing any conflict in movement at intersections. The proposed network maintains a low-cost at-grade infrastructure, but does not require stop signs or traffic signals, which can delay traffic. Hence, the mobility performance of the proposed network is expected to be better than that of a traditional grid network. A proof-of-concept is conducted through microscopic traffic simulation, in order to take into account individual driving behaviors. The numerical results are very impressive. Discussions regarding practical issues are also provided. Nevertheless, the Chet network is original. It can be considered as an innovative design that could change the way of how people live and travel.
{"title":"A new at-grade transportation network without conflict movement at intersections","authors":"S. Pravinvongvuth, Imalka C. Matarage","doi":"10.1080/21680566.2022.2111377","DOIUrl":"https://doi.org/10.1080/21680566.2022.2111377","url":null,"abstract":"This research aims to propose a new form of transportation network, the Chet network, to facilitate vehicular flow within a new area of built environment. One- and two-way links are uniquely arranged to form hexagonal blocks, such that vehicles can move from one place to another without facing any conflict in movement at intersections. The proposed network maintains a low-cost at-grade infrastructure, but does not require stop signs or traffic signals, which can delay traffic. Hence, the mobility performance of the proposed network is expected to be better than that of a traditional grid network. A proof-of-concept is conducted through microscopic traffic simulation, in order to take into account individual driving behaviors. The numerical results are very impressive. Discussions regarding practical issues are also provided. Nevertheless, the Chet network is original. It can be considered as an innovative design that could change the way of how people live and travel.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":"1 1","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41709149","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-08-03DOI: 10.1080/21680566.2022.2101565
Ling Wang, Li Zou, M. Abdel-Aty, Wanjing Ma
The proportion of rear-end crashes is the highest for expressways. An effective ways to reduce the rear-end crash risk is Active Traffic Management (ATM), and knowing the mechanism of how contributing factors affect crash risk in space and time is the foundation of ATM. However, the existing studies are mainly based on highly aggregated traffic data. It is hard to capture the evolution mechanisms of crash risk. Meanwhile, crash risk mechanisms might be heterogeneous in smooth and congestion states. This study explored the crash mechanisms in different traffic states with high-resolution trajectory data. First, an ordered clustering method is used to divide a four km expressway section into several segments as the spatial unit. Second, the spatial–temporal ranges are decided by the spatial–temporal correlations analyses between crash risk and potential contributing factors. Thirdly, three types of time-series models are established to quantitatively obtain the impacts of contributing factors on the crash risks. The results showed that crash risk is mainly decided by the upstream contributing factors under smooth states, and determined by the downstream factors under congestion conditions.
{"title":"Expressway rear-end crash risk evolution mechanism analysis under different traffic states","authors":"Ling Wang, Li Zou, M. Abdel-Aty, Wanjing Ma","doi":"10.1080/21680566.2022.2101565","DOIUrl":"https://doi.org/10.1080/21680566.2022.2101565","url":null,"abstract":"The proportion of rear-end crashes is the highest for expressways. An effective ways to reduce the rear-end crash risk is Active Traffic Management (ATM), and knowing the mechanism of how contributing factors affect crash risk in space and time is the foundation of ATM. However, the existing studies are mainly based on highly aggregated traffic data. It is hard to capture the evolution mechanisms of crash risk. Meanwhile, crash risk mechanisms might be heterogeneous in smooth and congestion states. This study explored the crash mechanisms in different traffic states with high-resolution trajectory data. First, an ordered clustering method is used to divide a four km expressway section into several segments as the spatial unit. Second, the spatial–temporal ranges are decided by the spatial–temporal correlations analyses between crash risk and potential contributing factors. Thirdly, three types of time-series models are established to quantitatively obtain the impacts of contributing factors on the crash risks. The results showed that crash risk is mainly decided by the upstream contributing factors under smooth states, and determined by the downstream factors under congestion conditions.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":"1 1","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"60434232","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-08-01DOI: 10.1080/21680566.2022.2103050
Hao Chen, Xi Zhang, Wenyan Yang, Yi-Mou Lin
This paper systematically investigates pedestrian trajectory prediction through a data-driven stacking fusion approach. Firstly, a novel Attention Mechanism-Long Short-Term Memory Network (Att-LSTM) is presented for pedestrian trajectory prediction, pedestrian heterogeneity and pedestrians–dynamic vehicles interactions are considered. Then, a Modified Social Force Model (MSFM) is developed for pedestrian trajectory prediction. The collision avoidance with conflicting dynamic vehicles and pedestrians, the influence of crosswalk boundary and pedestrian heterogeneity are considered. Finally, a data-driven stacking fusion model based on the Att-LSTM and MSFM is developed, and ridge model is used to prevent model overfitting and enhance model robustness. Moreover, traffic data of an un-signalised crosswalk is collected; the non-measurable parameters are calibrated through the Maximum-Likelihood Estimation. The model evaluation results show that the stacking fusion model performs better than the existing methods, which make it possible for autonomous vehicle to present great feasibility for improving pedestrian safety and traffic efficiency.
{"title":"A data-driven stacking fusion approach for pedestrian trajectory prediction","authors":"Hao Chen, Xi Zhang, Wenyan Yang, Yi-Mou Lin","doi":"10.1080/21680566.2022.2103050","DOIUrl":"https://doi.org/10.1080/21680566.2022.2103050","url":null,"abstract":"This paper systematically investigates pedestrian trajectory prediction through a data-driven stacking fusion approach. Firstly, a novel Attention Mechanism-Long Short-Term Memory Network (Att-LSTM) is presented for pedestrian trajectory prediction, pedestrian heterogeneity and pedestrians–dynamic vehicles interactions are considered. Then, a Modified Social Force Model (MSFM) is developed for pedestrian trajectory prediction. The collision avoidance with conflicting dynamic vehicles and pedestrians, the influence of crosswalk boundary and pedestrian heterogeneity are considered. Finally, a data-driven stacking fusion model based on the Att-LSTM and MSFM is developed, and ridge model is used to prevent model overfitting and enhance model robustness. Moreover, traffic data of an un-signalised crosswalk is collected; the non-measurable parameters are calibrated through the Maximum-Likelihood Estimation. The model evaluation results show that the stacking fusion model performs better than the existing methods, which make it possible for autonomous vehicle to present great feasibility for improving pedestrian safety and traffic efficiency.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42942686","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-07-27DOI: 10.1080/21680566.2022.2102553
Murat Bayrak, Zhengyao Yu, V. Gayah
The treatment of left turns at signalized intersections drives the development of signal phasing and timing plans and also plays an important role in overall traffic network operations. Accommodating left turns allows for the most direct routeing but reduces intersection capacity, whereas restricting left turns improves capacity but requires some vehicles to travel longer distances. This paper proposes a population-based incremental learning (PBIL) algorithm to determine at which intersections left-turn restrictions should be enacted to maximize a network's operational performance. The performance of each configuration is tested in a micro-simulation environment on both perfect and imperfect square grid networks. Comparison with a partial enumeration of feasible options reveals that the PBIL algorithm is effective at identifying a near-optimal configuration of left-turn restrictions. The resulting configurations suggest that left turns should be generally restricted at intersections that carry the most flow. These intersections typically occur in the central portion of the network when demands are relatively uniform. Doing so helps to provide additional intersection capacity at the locations where it is most necessary, while minimizing the additional travel distance that is incurred due to detours caused by the left-turn restrictions. These provide insight as to how urban traffic networks might be managed to improve network efficiency by only enacting left-turn restrictions at a subset of locations.
{"title":"A population-based incremental learning algorithm to identify optimal location of left-turn restrictions in urban grid networks","authors":"Murat Bayrak, Zhengyao Yu, V. Gayah","doi":"10.1080/21680566.2022.2102553","DOIUrl":"https://doi.org/10.1080/21680566.2022.2102553","url":null,"abstract":"The treatment of left turns at signalized intersections drives the development of signal phasing and timing plans and also plays an important role in overall traffic network operations. Accommodating left turns allows for the most direct routeing but reduces intersection capacity, whereas restricting left turns improves capacity but requires some vehicles to travel longer distances. This paper proposes a population-based incremental learning (PBIL) algorithm to determine at which intersections left-turn restrictions should be enacted to maximize a network's operational performance. The performance of each configuration is tested in a micro-simulation environment on both perfect and imperfect square grid networks. Comparison with a partial enumeration of feasible options reveals that the PBIL algorithm is effective at identifying a near-optimal configuration of left-turn restrictions. The resulting configurations suggest that left turns should be generally restricted at intersections that carry the most flow. These intersections typically occur in the central portion of the network when demands are relatively uniform. Doing so helps to provide additional intersection capacity at the locations where it is most necessary, while minimizing the additional travel distance that is incurred due to detours caused by the left-turn restrictions. These provide insight as to how urban traffic networks might be managed to improve network efficiency by only enacting left-turn restrictions at a subset of locations.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42640250","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-07-22DOI: 10.1080/21680566.2022.2103051
Mehmet Sirin Artan, İ. Şahin
Deteriorations are considered in the design phase of timetables to maintain reliability in actual operations. The response of periodic timetables to deteriorating events should be tracked and delays are desired to settle within a reasonable amount of time. We analysed an urban and intercity train service operating in separate lines in the Dutch railway network to measure their service reliability. Because trains are supposed to periodically depart from their respective terminals according to their schedules, their arrival delays and the allocated terminal slacks play a crucial role in reliability. We adopted a Markov chain model to represent the delay evolution of trains and examine their recovery patterns. The steady-state probabilities were uniquely and precisely obtained using the non-homogeneous matrices of the successive processes in combination within a cycle. It is observed that the timetables of the two train services can return to their periodicity and steady-state at most in one cycle.
{"title":"A stochastic model for reliability analysis of periodic train timetables","authors":"Mehmet Sirin Artan, İ. Şahin","doi":"10.1080/21680566.2022.2103051","DOIUrl":"https://doi.org/10.1080/21680566.2022.2103051","url":null,"abstract":"Deteriorations are considered in the design phase of timetables to maintain reliability in actual operations. The response of periodic timetables to deteriorating events should be tracked and delays are desired to settle within a reasonable amount of time. We analysed an urban and intercity train service operating in separate lines in the Dutch railway network to measure their service reliability. Because trains are supposed to periodically depart from their respective terminals according to their schedules, their arrival delays and the allocated terminal slacks play a crucial role in reliability. We adopted a Markov chain model to represent the delay evolution of trains and examine their recovery patterns. The steady-state probabilities were uniquely and precisely obtained using the non-homogeneous matrices of the successive processes in combination within a cycle. It is observed that the timetables of the two train services can return to their periodicity and steady-state at most in one cycle.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46721465","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}
As the technology of autonomous vehicle develops, online hailing autonomous taxi system is regarded as one of the most popular public transportation services in the future. Studies related to demand forecasting, ride matching, path planning, relocation, and pricing strategy for shared online hailing and autonomous taxi services have emerged in recent years. In this study, we conducted a survey based on 141 representative literatures from 1995 to 2022 to understand the state-of-the-art of the key problems of operating autonomous taxi service. First, a comprehensive review of the components of the shared autonomous taxi modelling is presented. Then, how the emerging technologies such as internet of vehicles, big data, cloud and edge computing, and blockchain can be used to enhance the autonomous taxi service is discussed. Last, the current research challenges and the concern or hurdle in public’s adoption of autonomous taxi services are identified.
{"title":"Review of shared online hailing and autonomous taxi services","authors":"Weiliang Zeng, Miaosen Wu, Peng Chen, Zhiguang Cao, Shengli Xie","doi":"10.1080/21680566.2022.2092231","DOIUrl":"https://doi.org/10.1080/21680566.2022.2092231","url":null,"abstract":"As the technology of autonomous vehicle develops, online hailing autonomous taxi system is regarded as one of the most popular public transportation services in the future. Studies related to demand forecasting, ride matching, path planning, relocation, and pricing strategy for shared online hailing and autonomous taxi services have emerged in recent years. In this study, we conducted a survey based on 141 representative literatures from 1995 to 2022 to understand the state-of-the-art of the key problems of operating autonomous taxi service. First, a comprehensive review of the components of the shared autonomous taxi modelling is presented. Then, how the emerging technologies such as internet of vehicles, big data, cloud and edge computing, and blockchain can be used to enhance the autonomous taxi service is discussed. Last, the current research challenges and the concern or hurdle in public’s adoption of autonomous taxi services are identified.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44679599","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-06-25DOI: 10.1080/21680566.2022.2089271
Mansour Johari, Shang Jiang, M. Keyvan-Ekbatani, D. Ngoduy
ABSTRACT Empirical studies have demonstrated the existence of a well-defined Network Macroscopic Fundamental Diagram (NMFD). Well-shaped NMFD, however, may not be a universal law because urban networks often display heterogeneous congestion distributions. Therefore, different algorithms have been proposed to partition a heterogeneous network into homogeneous sub-networks. These algorithms mainly consider uni-modal networks, despite the multi-modal nature of urban traffic flows. This paper is one of the first studies dedicated to the partitioning problem of bi-modal networks. First, a three-step partitioning algorithm is developed concerning NMFD-based applications. Second, the role played by mode differentiation in bi-modal network partitioning is investigated through the lens of speed-NMFDs. The results demonstrate that the algorithm performs well. Mode differentiation should be considered in the partitioning process while is defined differently in free-flow and saturated conditions. The links' lengths, bus stop distribution, speed limit zone, and the existence of bus terminals might affect speed-NMFD properties.
{"title":"Mode differentiation in partitioning of mixed bi-modal urban networks","authors":"Mansour Johari, Shang Jiang, M. Keyvan-Ekbatani, D. Ngoduy","doi":"10.1080/21680566.2022.2089271","DOIUrl":"https://doi.org/10.1080/21680566.2022.2089271","url":null,"abstract":"ABSTRACT Empirical studies have demonstrated the existence of a well-defined Network Macroscopic Fundamental Diagram (NMFD). Well-shaped NMFD, however, may not be a universal law because urban networks often display heterogeneous congestion distributions. Therefore, different algorithms have been proposed to partition a heterogeneous network into homogeneous sub-networks. These algorithms mainly consider uni-modal networks, despite the multi-modal nature of urban traffic flows. This paper is one of the first studies dedicated to the partitioning problem of bi-modal networks. First, a three-step partitioning algorithm is developed concerning NMFD-based applications. Second, the role played by mode differentiation in bi-modal network partitioning is investigated through the lens of speed-NMFDs. The results demonstrate that the algorithm performs well. Mode differentiation should be considered in the partitioning process while is defined differently in free-flow and saturated conditions. The links' lengths, bus stop distribution, speed limit zone, and the existence of bus terminals might affect speed-NMFD properties.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46909710","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-06-09DOI: 10.1080/21680566.2022.2083033
Zebin Chen, Shukai Li, Huimin Zhang, Yanhui Wang, Lixing Yang
This paper aims to propose a novel distributed model predictive control (MPC) scheme for real-time train regulation in urban metro transportation. Particularly, a nonlinear real-time train regulation model is put forward to minimize the timetable deviations and the control strategies for each trainunder the uncertain disturbances, which is then reformulated into a linear optimization model for easy to solve. By regarding each train as a subsystem, we design the distributed MPC algorithm based on the Dantzig-Wolfe decomposition for the train regulation problem, which decomposes the original optimization problem into numerous smaller and less complicated optimization control problems that can be solved independently. Under the distributed mechanism, we regard each train as a local subsystem, which only interacts with the coordinator, ensuring the flexibility and modularity of the control structure. Numerical cases are provided to demonstrate the effectiveness and robustness of the proposed distributed MPC method.
{"title":"Distributed model predictive control for real-time train regulation of metro line based on Dantzig-Wolfe decomposition","authors":"Zebin Chen, Shukai Li, Huimin Zhang, Yanhui Wang, Lixing Yang","doi":"10.1080/21680566.2022.2083033","DOIUrl":"https://doi.org/10.1080/21680566.2022.2083033","url":null,"abstract":"This paper aims to propose a novel distributed model predictive control (MPC) scheme for real-time train regulation in urban metro transportation. Particularly, a nonlinear real-time train regulation model is put forward to minimize the timetable deviations and the control strategies for each trainunder the uncertain disturbances, which is then reformulated into a linear optimization model for easy to solve. By regarding each train as a subsystem, we design the distributed MPC algorithm based on the Dantzig-Wolfe decomposition for the train regulation problem, which decomposes the original optimization problem into numerous smaller and less complicated optimization control problems that can be solved independently. Under the distributed mechanism, we regard each train as a local subsystem, which only interacts with the coordinator, ensuring the flexibility and modularity of the control structure. Numerical cases are provided to demonstrate the effectiveness and robustness of the proposed distributed MPC method.","PeriodicalId":48872,"journal":{"name":"Transportmetrica B-Transport Dynamics","volume":" ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49164779","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
扫码关注我们
求助内容：
应助结果提醒方式：