Communications in Transportation Research最新文献

{"title":"AGNP: Network-wide short-term probabilistic traffic speed prediction and imputation","authors":"Meng Xu ,&nbsp;Yining Di ,&nbsp;Hongxing Ding ,&nbsp;Zheng Zhu ,&nbsp;Xiqun Chen ,&nbsp;Hai Yang","doi":"10.1016/j.commtr.2023.100099","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100099","url":null,"abstract":"<div><p>The data-driven Intelligent Transportation System (<span>ITS</span>) provides great support to travel decisions and system management but inevitably encounters the issue of data missing in monitoring systems. Hence, network-wide traffic state prediction and imputation is critical to recognizing the system level state of a transportation network. Abundant research works have adopted various approaches for traffic prediction and imputation. However, previous methods ignore the reliability analysis of the predicted/imputed traffic information. Thus, this study originally proposes an attentive graph neural process (AGNP) method for network-level short-term traffic speed prediction and imputation, simultaneously considering reliability. Firstly, the Gaussian process (GP) is used to model the observed traffic speed state. Such a stochastic process is further learned by the proposed AGNP method, which is utilized for inferring the congestion state on the remaining unobserved road segments. Data from a transportation network in Anhui Province, China, is used to conduct three experiments with increasing missing data ratio for model testing. Based on comparisons against other machine learning models, the results show that the proposed AGNP model can impute traffic networks and predict traffic speed with high-level performance. With the probabilistic confidence provided by the AGNP, reliability analysis is conducted both numerically and visually to show that the predicted distributions are beneficial to guide traffic control strategies and travel plans.</p></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49705278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A predictive chance constraint rebalancing approach to mobility-on-demand services","authors":"Sten Elling Tingstad Jacobsen ,&nbsp;Anders Lindman ,&nbsp;Balázs Kulcsár","doi":"10.1016/j.commtr.2023.100097","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100097","url":null,"abstract":"<div><p>This paper considers the problem of supply-demand imbalances in Mobility-on-Demand (MoD) services. These imbalances occur due to uneven stochastic travel demand and can be mitigated by proactively rebalancing empty vehicles to areas where the demand is high. To achieve this, we propose a method that takes into account uncertainties of predicted travel demand while minimizing pick-up time and rebalance mileage for autonomous MoD ride-hailing. More precisely, first travel demand is predicted using Gaussian Process Regression (GPR) which provides uncertainty bounds on the prediction. We then formulate a stochastic model predictive control (MPC) for the autonomous ride-hailing service and integrate the demand predictions with uncertainty bounds. In order to guarantee constraint satisfaction in the optimization under estimated stochastic demand prediction, we employ a probabilistic constraining method with user-defined confidence interval, using Chance Constrained MPC (CCMPC). The benefits of the proposed method are twofold. First, travel demand uncertainty prediction from data can naturally be embedded into the MoD optimization framework, allowing us to keep the imbalance at each station below a certain threshold with a user-defined probability. Second, CCMPC can be relaxed into a Mixed-Integer-Linear-Program (MILP) and the MILP can be solved as a corresponding Linear-Program, which always admits an integral solution. Our transportation simulations show that by tuning the confidence bound on the chance constraint, close to optimal oracle performance can be achieved, with a median customer wait time reduction of 4% compared to using only the mean prediction of the GPR.</p></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49705304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Corrigendum to “Assessing impacts to maritime shipping from marine chokepoint closures” [Commun. Transport. Res. 3 (2023) 100083]","authors":"Lincoln F. Pratson","doi":"10.1016/j.commtr.2023.100100","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100100","url":null,"abstract":"","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49705292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Resilience assessment framework toward interdependent bus–rail transit network: Structure, critical components, and coupling mechanism","authors":"Bing Liu ,&nbsp;Xiaoyue Liu ,&nbsp;Yang Yang ,&nbsp;Xi Chen ,&nbsp;Xiaolei Ma","doi":"10.1016/j.commtr.2023.100098","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100098","url":null,"abstract":"<div><p>Understanding the interdependent nature of multimodal public transit networks (PTNs) is vital for ensuring the resilience and robustness of transportation systems. However, previous studies have predominantly focused on assessing the vulnerability and characteristics of single-mode PTNs, neglecting the impacts of heterogeneous disturbances and shifts in travel behavior within multimodal PTNs. Therefore, this study introduces a novel resilience assessment framework that comprehensively analyzes the coupling mechanism, structural and functional characteristics of bus–rail transit networks (BRTNs). In this framework, a network performance metric is proposed by considering the passengers’ travel behaviors under various disturbances. Additionally, stations and subnetworks are classified using the <em>k</em>-means algorithm and resilience metric by simulating various disturbances occurring at each station or subnetwork. The proposed framework is validated via a case study of a BRTN in Beijing, China. Results indicate that the rail transit network (RTN) plays a crucial role in maintaining network function and resisting external disturbances in the interdependent BRTN. Furthermore, the coupling interactions between the RTN and bus transit network (BTN) exhibit distinct characteristics under infrastructure component disruption and functional disruption. These findings provide valuable insights into emergency management for PTNs and understanding the coupling relationship between BTN and RTN.</p></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49705290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Reliability of electric vehicle charging infrastructure: A cross-lingual deep learning approach","authors":"Yifan Liu ,&nbsp;Azell Francis ,&nbsp;Catharina Hollauer ,&nbsp;M. Cade Lawson ,&nbsp;Omar Shaikh ,&nbsp;Ashley Cotsman ,&nbsp;Khushi Bhardwaj ,&nbsp;Aline Banboukian ,&nbsp;Mimi Li ,&nbsp;Anne Webb ,&nbsp;Omar Isaac Asensio","doi":"10.1016/j.commtr.2023.100095","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100095","url":null,"abstract":"<div><p>Vehicle electrification has emerged as a global strategy to address climate change and emissions externalities from the transportation sector. Deployment of charging infrastructure is needed to accelerate technology adoption; however, managers and policymakers have had limited evidence on the use of public charging stations due to poor data sharing and decentralized ownership across regions. In this article, we use machine learning based classifiers to reveal insights about consumer charging behavior in 72 detected languages including Chinese. We investigate 10 years of consumer reviews in East and Southeast Asia from 2011 to 2021 to enable infrastructure evaluation at a larger geographic scale than previously available. We find evidence that charging stations at government locations result in higher failure rates with consumers compared to charging stations at private points of interest. This evidence contrasts with predictions in the U.S. and European markets, where the performance is closer to parity. We also find that networked stations with communication protocols provide a relatively higher quality of charging services, which favors policy support for connectivity, particularly for underserved or remote areas.</p></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49705343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"GOPS: A general optimal control problem solver for autonomous driving and industrial control applications","authors":"Wenxuan Wang,&nbsp;Yuhang Zhang,&nbsp;Jiaxin Gao,&nbsp;Yuxuan Jiang,&nbsp;Yujie Yang,&nbsp;Zhilong Zheng,&nbsp;Wenjun Zou,&nbsp;Jie Li,&nbsp;Congsheng Zhang,&nbsp;Wenhan Cao,&nbsp;Genjin Xie,&nbsp;Jingliang Duan,&nbsp;Shengbo Eben Li","doi":"10.1016/j.commtr.2023.100096","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100096","url":null,"abstract":"<div><p>Solving optimal control problems serves as the basic demand of industrial control tasks. Existing methods like model predictive control often suffer from heavy online computational burdens. Reinforcement learning has shown promise in computer and board games but has yet to be widely adopted in industrial applications due to a lack of accessible, high-accuracy solvers. Current Reinforcement learning (RL) solvers are often developed for academic research and require a significant amount of theoretical knowledge and programming skills. Besides, many of them only support Python-based environments and limit to model-free algorithms. To address this gap, this paper develops General Optimal control Problems Solver (GOPS), an easy-to-use RL solver package that aims to build real-time and high-performance controllers in industrial fields. GOPS is built with a highly modular structure that retains a flexible framework for secondary development. Considering the diversity of industrial control tasks, GOPS also includes a conversion tool that allows for the use of Matlab/Simulink to support environment construction, controller design, and performance validation. To handle large-scale problems, GOPS can automatically create various serial and parallel trainers by flexibly combining embedded buffers and samplers. It offers a variety of common approximate functions for policy and value functions, including polynomial, multilayer perceptron, convolutional neural network, etc. Additionally, constrained and robust algorithms for special industrial control systems with state constraints and model uncertainties are also integrated into GOPS. Several examples, including linear quadratic control, inverted double pendulum, vehicle tracking, humanoid robot, obstacle avoidance, and active suspension control, are tested to verify the performances of GOPS.</p></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49705165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"What's next for battery-electric bus charging systems","authors":"Ziling Zeng,&nbsp;Xiaobo Qu","doi":"10.1016/j.commtr.2023.100094","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100094","url":null,"abstract":"","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49705348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Formulation and solution for calibrating boundedly rational activity-travel assignment: An exploratory study","authors":"Dong Wang ,&nbsp;Feixiong Liao","doi":"10.1016/j.commtr.2023.100092","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100092","url":null,"abstract":"<div><p>Parameter calibration of the traffic assignment models is vital to travel demand analysis and management. As an extension of the conventional traffic assignment, boundedly rational activity-travel assignment (BR-ATA) combines activity-based modeling and traffic assignment endogenously and can capture the interdependencies between high dimensional choice facets along the activity-travel patterns. The inclusion of multiple episodes of activity participation and bounded rationality behavior enlarges the choice space and poses a challenge for calibrating the BR-ATA models. In virtue of the multi-state supernetwork, this exploratory study formulates the BR-ATA calibration as an optimization problem and analyzes the influence of the two additional components on the calibration problem. Considering the temporal dimension, we also propose a dynamic formulation of the BR-ATA calibration problem. The simultaneous perturbation stochastic approximation algorithm is adopted to solve the proposed calibration problems. Numerical examples are presented to calibrate the activity-based travel demand for illustrations. The results demonstrate the feasibility of the solution method and show that the parameter characterizing the bounded rationality behavior has a significant effect on the convergence of the calibration solutions.</p></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49710075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Impact of the COVID-19 pandemic and generational heterogeneity on ecommerce shopping styles – A case study of Sacramento, California","authors":"Qianhua Luo ,&nbsp;Teddy Forscher ,&nbsp;Susan Shaheen ,&nbsp;Elizabeth Deakin ,&nbsp;Joan L. Walker","doi":"10.1016/j.commtr.2023.100091","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100091","url":null,"abstract":"<div><p>The COVID pandemic has accelerated the growth of ecommerce and reshaped shopping patterns, which in turn impacts trip-making and vehicle miles traveled. The objectives of this study are to define shopping styles and quantify their prevalence in the population, investigate the impact of the pandemic on shopping style transition, understand the generational heterogeneity and other factors that influence shopping styles, and comment on the potential impact of the pandemic on long-term shopping behavior. Two months after the initial shutdown (May/June 2021), we collected ecommerce behavioral data from 313 Sacramento Region households using an online survey. A <em>K</em>-means clustering analysis of shopping behavior across eight commodity types identified five shopping styles, including ecommerce independent, ecommerce dependent, and three mixed modes in-between. We found that the share of ecommerce independent style shifted from 55% pre-pandemic to 27% during the pandemic. Overall, 30% kept the same style as pre-pandemic, 54% became more ecommerce dependent, and 16% became less ecommerce dependent, with the latter group more likely to view shopping an excuse to get out. Heterogeneity was found across generations. Pre-pandemic, Millennials and Gen Z were the most ecommerce dependent, but during the pandemic they made relatively small shifts toward increased ecommerce dependency. Baby Boomers and the Silent Generation were bimodal, either sticking to in-person shopping or shifting to ecommerce-dependency during the pandemic. Post-pandemic intentions varied across styles, with households who primarily adopt non-food ecommerce intending to reverse back to in-person shopping, while the highly ecommerce dependent intend to limit future in-store activities.</p></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49710058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Online prediction of network-level public transport demand based on principle component analysis","authors":"Cheng Zhong,&nbsp;Peiling Wu,&nbsp;Qi Zhang,&nbsp;Zhenliang Ma","doi":"10.1016/j.commtr.2023.100093","DOIUrl":"https://doi.org/10.1016/j.commtr.2023.100093","url":null,"abstract":"<div><p>Online demand prediction plays an important role in transport network services from operations, controls to management, and information provision. However, the online prediction models are impacted by streaming data quality issues with noise measurements and missing data. To address these, we develop a robust prediction method for online network-level demand prediction in public transport. It consists of a PCA method to extract eigen demand images and an optimization-based pattern recognition model to predict the weights of eigen demand images by making use of the partially observed real-time data up to the prediction time in a day. The prediction model is robust to data quality issues given that the eigen demand images are stable and the predicted weights of them are optimized using the network level data (less impacted by local data quality issues). In the case study, we validate the accuracy and transferability of the model by comparing it with benchmark models and evaluate the robustness in tolerating data quality issues of the proposed model. The experimental results demonstrate that the proposed Pattern Recognition Prediction based on PCA (PRP-PCA) consistently outperforms other benchmark models in accuracy and transferability. Moreover, the model shows high robustness in accommodating data quality issues. For example, the PRP-PCA model is robust to missing data up to 50% regardless of the noise level. We also discuss the hidden patterns behind the network level demand. The visualization analysis shows that eigen demand images are significantly connected to the network structure and station activity variabilities. Though the demand changes dramatically before and after the pandemic, the eigen demand images are consistent over time in Stockholm.</p></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49710061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}