Transportation Research Part B-Methodological最新文献

{"title":"Automated lane changing control in mixed traffic: An adaptive dynamic programming approach","authors":"Sayan Chakraborty ,&nbsp;Leilei Cui ,&nbsp;Kaan Ozbay ,&nbsp;Zhong-Ping Jiang","doi":"10.1016/j.trb.2024.103026","DOIUrl":"10.1016/j.trb.2024.103026","url":null,"abstract":"<div><p>The majority of the past research dealing with lane-changing controller design of autonomous vehicles (<span><math><mrow><mi>A</mi><mi>V</mi></mrow></math></span>s) is based on the assumption of full knowledge of the model dynamics of the <span><math><mrow><mi>A</mi><mi>V</mi></mrow></math></span> and the surrounding vehicles. However, in the real world, this is not a very realistic assumption as accurate dynamic models are difficult to obtain. Also, the dynamic model parameters might change over time due to various factors. Thus, there is a need for a learning-based lane change controller design methodology that can learn the optimal control policy in real time using sensor data. In this paper, we have addressed this need by introducing an optimal learning-based control methodology that can solve the real-time lane-changing problem of <span><math><mrow><mi>A</mi><mi>V</mi></mrow></math></span>s, where the input-state data of the <span><math><mrow><mi>A</mi><mi>V</mi></mrow></math></span> is utilized to generate a near-optimal lane-changing controller by approximate/adaptive dynamic programming (ADP) technique. In the case of this type of complex lane-changing maneuver, the lateral dynamics depend on the longitudinal velocity of the vehicle. If the longitudinal velocity is assumed constant, a linear parameter invariant model can be used. However, assuming constant velocity while performing a lane-changing maneuver is not a realistic assumption. This assumption might increase the risk of accidents, especially in the case of lane abortion when the surrounding vehicles are not cooperative. Thus, in this paper, the dynamics of the <span><math><mrow><mi>A</mi><mi>V</mi></mrow></math></span> are assumed to be a linear parameter-varying system. Thus we have two challenges for the lane-changing controller design: parameter-varying, and unknown dynamics. With the help of both gain scheduling and ADP techniques combined, a learning-based control algorithm that can generate a near-optimal lane-changing controller without having to know the accurate dynamic model of the <span><math><mrow><mi>A</mi><mi>V</mi></mrow></math></span> is proposed. The inclusion of a gain scheduling approach with ADP makes the controller applicable to non-linear and/or parameter-varying <span><math><mrow><mi>A</mi><mi>V</mi></mrow></math></span> dynamics. The stability of the learning-based gain scheduling controller has also been rigorously proved. Moreover, a data-driven lane-changing decision-making algorithm is introduced that can make the <span><math><mrow><mi>A</mi><mi>V</mi></mrow></math></span> perform a lane abortion if safety conditions are violated during a lane change. Finally, the proposed learning-based gain scheduling controller design algorithm and the lane-changing decision-making methodology are numerically validated using MATLAB, SUMO simulations, and the NGSIM dataset.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"187 ","pages":"Article 103026"},"PeriodicalIF":5.8,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141891584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Uncapacitated single-allocation hub median location with edge upgrading: Models and exact solution algorithms","authors":"Mercedes Landete ,&nbsp;Juan M. Muñoz-Ocaña ,&nbsp;Antonio M. Rodríguez-Chía ,&nbsp;Francisco Saldanha-da-Gama","doi":"10.1016/j.trb.2024.103034","DOIUrl":"10.1016/j.trb.2024.103034","url":null,"abstract":"<div><p>In this paper, a class of single-allocation hub location problems is investigated from the perspective of upgrading. The latter is understood as an improvement of a set of edges to increase their individual performance, e.g., a decreased unit transportation cost. The goal is to obtain an improved optimal solution to the problem compared to that obtained if upgrading was not done. A budget constraint is assumed to limit the upgrading operations. A flow-based formulation is initially proposed that extends a classical model for uncapacitated single-allocation hub location with complete hub networks. Nevertheless, the fact that the unit costs after upgrading may violate the triangle inequality needs to be accounted for. Since the proposed formulation has a high computing burden, different possibilities are discussed for enhancing it. This leads to devising an efficient branch-and-cut algorithm with different variants. Additionally, a formulation based on the discrete ordered median function is also introduced that is also enhanced and embedded into a branch-and-cut algorithm again with several variants. All models and algorithms are also adapted to problems embedding hub network design decisions. Extensive computational tests were conducted to assess the methodological contributions proposed.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"187 ","pages":"Article 103034"},"PeriodicalIF":5.8,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0191261524001589/pdfft?md5=d977da13a6c063a73f6535a9c44f0b53&pid=1-s2.0-S0191261524001589-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141891585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Approximate dynamic programming for pickup and delivery problem with crowd-shipping","authors":"Kianoush Mousavi ,&nbsp;Merve Bodur ,&nbsp;Mucahit Cevik ,&nbsp;Matthew J. Roorda","doi":"10.1016/j.trb.2024.103027","DOIUrl":"10.1016/j.trb.2024.103027","url":null,"abstract":"<div><p>We study a variant of dynamic pickup and delivery crowd-shipping operation for delivering online orders within a few hours from a brick-and-mortar store. This crowd-shipping operation is subject to a high degree of uncertainty due to the stochastic arrival of online orders and crowd-shippers that impose several challenges for efficient matching of orders to crowd-shippers. We formulate the problem as a Markov decision process and develop an Approximate Dynamic Programming (ADP) policy using value function approximation for obtaining a highly scalable and real-time matching strategy while considering temporal and spatial uncertainty in arrivals of online orders and crowd-shippers. We incorporate several algorithmic enhancements to the ADP algorithm, which significantly improve the convergence. We compare the ADP policy with an optimization-based myopic policy using various performance measures. Our numerical analysis with varying parameter settings shows that ADP policies can lead to up to 25.2% cost savings and a 9.8% increase in the number of served orders. Overall, we find that our proposed framework can guide crowd-shipping platforms for efficient real-time matching decisions and enhance the platform delivery capacity.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"187 ","pages":"Article 103027"},"PeriodicalIF":5.8,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0191261524001516/pdfft?md5=a403f465827064c17e360b684a0c494e&pid=1-s2.0-S0191261524001516-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141891586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Queue replacement principle for corridor problems with heterogeneous commuters","authors":"Takara Sakai ,&nbsp;Takashi Akamatsu ,&nbsp;Koki Satsukawa","doi":"10.1016/j.trb.2024.103024","DOIUrl":"10.1016/j.trb.2024.103024","url":null,"abstract":"<div><p>This study investigates the theoretical properties of a departure time choice problem considering commuters’ heterogeneity with respect to the value of schedule delay in corridor networks. Specifically, we develop an analytical method to solve the dynamic system optimal (DSO) and dynamic user equilibrium (DUE) problems. To derive the DSO solution, we first demonstrate the bottleneck-based decomposition property, i.e., the DSO problem can be decomposed into multiple single bottleneck problems. Subsequently, we obtain the analytical solution by applying the theory of optimal transport to each decomposed problem and derive optimal congestion prices to achieve the DSO state. To derive the DUE solution, we prove the queue replacement principle (QRP) that the time-varying optimal congestion prices are equal to the queueing delay in the DUE state at every bottleneck. This principle enables us to derive a closed-form DUE solution based on the DSO solution. Moreover, as an application of the QRP, we prove that the equilibrium solution under various policies (e.g., on-ramp metering, on-ramp pricing, and its partial implementation) can be obtained analytically. Finally, we compare these equilibria with the DSO state.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"187 ","pages":"Article 103024"},"PeriodicalIF":5.8,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0191261524001486/pdfft?md5=514aa11562e2ef88b53e31071afb3505&pid=1-s2.0-S0191261524001486-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141953095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The use of pooled RP-SP choice data to simultaneously identify alternative attributes and random coefficients on those attributes","authors":"Mehek Biswas ,&nbsp;Chandra R. Bhat ,&nbsp;Abdul Rawoof Pinjari","doi":"10.1016/j.trb.2024.102988","DOIUrl":"https://doi.org/10.1016/j.trb.2024.102988","url":null,"abstract":"<div><p>Random utility maximization-based discrete choice models involve utility functions that are typically specified with explanatory variables representing alternative-specific attributes. It may be useful to specify some alternative-specific attributes as stochastic in situations when the analyst cannot accurately measure the attribute values considered by the decision maker. In addition, the parameters representing decision makers’ response to the attributes may have to be specified as stochastic to recognize response heterogeneity in the population. Ignoring either of these two sources of stochasticity can lead to biased parameter estimates and distorted willingness-to-pay estimates. Further, in some situations the analyst may not even have access to measurements of important alternative-specific attributes to include them in the utility specification. In this study, we explore the feasibility of simultaneously inferring alternative attributes and the corresponding coefficients, as well as stochasticity in both – without the help of external measurement data on alternative attributes – using mixed logit models on pooled revealed preference (RP) and stated preference (SP) choice datasets. To do so, we first theoretically examine parameter identifiability for different specifications and distributional forms of alternative attributes and their coefficients. Next, we illustrate this through simulation experiments in a travel mode choice setting and demonstrate the conditions under which pooled RP-SP data can help disentangle stochastic alternative attributes from random coefficients. In addition, an empirical application is presented in the context of commute mode choice in Bengaluru, India, to demonstrate the importance of recognizing stochasticity in mode-specific in-vehicle travel times along with the random coefficient on in-vehicle travel times.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"186 ","pages":"Article 102988"},"PeriodicalIF":5.8,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141582781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Using traffic assignment models to assist Bayesian inference for origin–destination matrices","authors":"Martin L. Hazelton,&nbsp;Lara Najim","doi":"10.1016/j.trb.2024.103019","DOIUrl":"https://doi.org/10.1016/j.trb.2024.103019","url":null,"abstract":"<div><p>Estimation of traffic volumes between each origin and destination of travel is a standard practice in transport engineering. Commonly the available data constitute traffic counts at various locations on the network, supplemented by a survey-based prior estimate of mean origin–destination traffic volumes. Statistical inference in this type of network tomography problem is known to be challenging. Moreover, the difficulties are increased in practice by the presence of a large number of nuisance parameters corresponding to route choice probabilities, for which we have no direct prior information. Working in a Bayesian framework, we determine these parameters using a stochastic user equilibrium route choice model. We develop an MCMC algorithm for model fitting. This requires repeated computation of stochastic user equilibrium flows, and so we develop a computationally cheap emulator. Our methods are tested on numerical examples based on a section of the road network in the English city of Leicester.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"186 ","pages":"Article 103019"},"PeriodicalIF":5.8,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0191261524001437/pdfft?md5=852e3f63544510138922b5d782deb6d3&pid=1-s2.0-S0191261524001437-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141542992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The integer programing extreme value (IPEV) model: An application for estimation of the leisure trip demand","authors":"Koichi Kuriyama ,&nbsp;Yasushi Shoji ,&nbsp;Takahiro Tsuge","doi":"10.1016/j.trb.2024.103018","DOIUrl":"https://doi.org/10.1016/j.trb.2024.103018","url":null,"abstract":"<div><p>We developed an integer programing extreme value (IPEV) model that accounts the integer property of trip data and has the same advantages as the multiple discrete–continuous extreme value choice (MDCEV) model. The proposed model is consistent with utility theory and provides a single structural framework for simultaneously modeling the choice of alternatives and quantity decisions with the constraint of the integer value of consumption. We demonstrate that the proposed model has a closed-form probability expression. Finally, we apply the proposed model to the recreation demand for national parks in Japan. The empirical results suggest that the proposed model provides a better fit for the data than the previous model and that ignoring the integer property of demand might cause an underestimation of the welfare loss.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"186 ","pages":"Article 103018"},"PeriodicalIF":5.8,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0191261524001425/pdfft?md5=006abc7dc746d9d95b5dd3f5c32d2e56&pid=1-s2.0-S0191261524001425-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141543051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Beyond centralization: Non-cooperative perimeter control with extended mean-field reinforcement learning in urban road networks","authors":"Xinghua Li ,&nbsp;Xinyuan Zhang ,&nbsp;Xinwu Qian ,&nbsp;Cong Zhao ,&nbsp;Yuntao Guo ,&nbsp;Srinivas Peeta","doi":"10.1016/j.trb.2024.103016","DOIUrl":"https://doi.org/10.1016/j.trb.2024.103016","url":null,"abstract":"<div><p>Perimeter control is a traffic management approach aimed at regulating vehicular accumulation within urban regional networks by managing flows on all border-crossing roads. Methods based on the macroscopic fundamental diagram (MFD) fall short in providing specific metering for individual roads. Recent advancements in the cell transmission model (CTM) have attempted to address this limitation but are hindered by their reliance on centralized control, which requires the availability of full information and authority over traffic generation sites. Our study proposes an innovative decentralized, game-theoretical framework for perimeter control to address these practical challenges. It is structured around two key groups of agents: perimeter agents, tasked with managing border roads, and interior agents, focused on traffic within generation sites. The framework also incorporates mechanisms for interactions between these agents and the road network, aiming to optimize their individual utilities. Additionally, we have developed a multi-agent reinforcement learning (RL) algorithm, extending the mean-field theory concept, to address the complexity of simultaneous learning by multiple agents.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"186 ","pages":"Article 103016"},"PeriodicalIF":5.8,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141543050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Exploring the role of Mobility-as-a-Service in morning commuting trips","authors":"Manlian Pan ,&nbsp;Xiaotong Sun","doi":"10.1016/j.trb.2024.103017","DOIUrl":"https://doi.org/10.1016/j.trb.2024.103017","url":null,"abstract":"<div><p>Promising the seamless integration of multiple transportation modes, Mobility-as-a-Service (MaaS) has gained popularity over the years, yet its effectiveness in enticing private car users and improving travel efficiency remains uncertain. This study explores the competitiveness of MaaS-enabled multi-modal travel options versus private car usage through equilibrium analysis. In addition to pricing that affects the fixed cost for travel, we examine the often overlooked inconvenience cost associated with multi-modal trips. We establish our analysis for the commuting problem of a one-origin-one-destination network, where a highway and a mass transit line connect the residential area and the central business district (CBD) area. Travelers choose their departure time and travel mode among auto, Park-and-Ride (PnR), ride-hailing and transit (RnT) to minimize their total travel cost. Inconvenience costs associated with searching for parking and waiting for ride-hailing are explicitly modeled. We analytically provide the mode share and departure time windows under all possible equilibria. Our findings reveal the complex nature of mode choice, distinctly affected by fixed and inconvenience costs, with demand playing an even more significant role. Notably, fixed costs set an entry fee to adopt different modes, and the feature of inconvenience costs affects the utilization of available transportation resources. More importantly, to benefit the overall system, we encourage maintaining a balanced mode share by implementing pricing and capacity strategies rather than aiming for a completer transition of private car users to MaaS.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"186 ","pages":"Article 103017"},"PeriodicalIF":5.8,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141483806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"From silver to platinum: The impact of frequent flier tier levels on air travellers’ behaviour","authors":"Christiaan Behrens ,&nbsp;Gerben de Jong ,&nbsp;Jos van Ommeren","doi":"10.1016/j.trb.2024.102986","DOIUrl":"https://doi.org/10.1016/j.trb.2024.102986","url":null,"abstract":"<div><p>We estimate the switching costs created by tier levels, one of the main components of airline frequent flier programs, by exploiting discrete tier thresholds. We first demonstrate that travellers increase their demand to reach a higher tier level just before the end of the calendar year when tier levels are determined, but do not manipulate demand in earlier months. This allows for a novel fuzzy discontinuity approach to identify causal demand effects of higher tier levels, from which we derive the airline switching costs. While the lowest level creates only negligible switching costs, the switching costs associated with the highest tier level are in the range of 30%–41% of the price of a ticket, representing an important determinant of travel behaviour in airline markets. These results especially provide evidence of the use of tier levels to induce loyalty from high-frequency travellers for whom free flight awards alone would not create substantial switching costs.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"186 ","pages":"Article 102986"},"PeriodicalIF":5.8,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0191261524001103/pdfft?md5=5f1114d83f7784a12fac88c043693de2&pid=1-s2.0-S0191261524001103-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141483836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}