Transportation Research Part B-Methodological最新文献

{"title":"Making the most of your private parking slot: Strategy-proof double auctions-enabled staggered sharing schemes","authors":"Hao Yu ,&nbsp;Min Huang ,&nbsp;Yang Song ,&nbsp;Xingwei Wang ,&nbsp;Xiaohang Yue","doi":"10.1016/j.trb.2024.103102","DOIUrl":"10.1016/j.trb.2024.103102","url":null,"abstract":"<div><div>Platform-intermediated Private Parking Slot Sharing (PPSS) is broadly deemed a viable avenue to alleviate parking problems in metropolises. Despite a captivating future where PPSS will be as convenient as public parking today, tension is mounting in practice concerning how to efficiently match and price self-interested suppliers and demanders with incomplete information. To reconcile this tension, this paper delves into the nuances of PPSS operations and proposes double auction-based solutions that embed staggered sharing to integrate fragmented non-commute-driven demand. Confronting the intertwined difficulties of temporally heterogeneous and incompatible demands imposed by staggered sharing on auction mechanism design, we first propose a Demand Classification-based Trade Reduction (DCTR) auction mechanism that teases apart the conflated demands through the idea of “divide and conquer”. We prove theoretically that the DCTR auction mechanism satisfies Strategy-Proofness (SP), Budget Balance (BB), and Individual Rationality (IR) in general, and Asymptotic Efficiency (AsE) when demand categories are finite. To cut down the welfare loss due to distributed trade reduction in the DCTR auction mechanism when demands are diversified, we propose a family of Group Buying-based Trade Reduction (GBTR) auction mechanisms that unify demands through a preceding grouping process and conduct one unified trade reduction only. We contrive alternative group bid determination and trade reduction rules to accommodate distinct market conditions. To strengthen privacy preservation and relieve the strategy identification burden of cognitively limited bidders, we further design the Double-Clock implementations of the GBTR auction mechanisms (DC-GBTR) that additionally satisfy Unconditional Winner Privacy (UWP) and Obvious Strategy-Proofness (OSP). A hybrid mechanism is further designed to enable the integration of mechanisms that could induce budget deficits and orchestrate different auctions by automatically selecting the proper one depending on market conditions while ensuring BB in expectation. Extensive experimental results highlight the merits of incorporating staggered sharing in auction design, shed light on how to choose among alternative auctions to cater to distinct market conditions, showcase the superiority and potential of hybridization, and deduce managerial insights from the perspectives of different stakeholders to facilitate the navigation of PPSS marketplaces.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"191 ","pages":"Article 103102"},"PeriodicalIF":5.8,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142654730","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":"Safety, liability, and insurance markets in the age of automated driving","authors":"Daniel Vignon ,&nbsp;Sina Bahrami","doi":"10.1016/j.trb.2024.103115","DOIUrl":"10.1016/j.trb.2024.103115","url":null,"abstract":"<div><div>This paper investigates two fundamental questions related to safety and insurance in the age of automation. First, we touch upon the question of safety and liability under infrastructure-assisted automated driving. In such an environment, automakers provide vehicle automation technology while infrastructure support service providers (ISSPs) provide smart infrastructure services. Additionally, customers can receive coverage for accidents from either of these actors but also from legacy auto insurers. We investigate the effect of market structure on safety and accident coverage and show that an integrated monopoly provides full coverage and fully accounts for accident costs when choosing safety levels. However, in the Nash setting, even though full coverage obtains, lack of coordination leads to partial internalization of accident costs by the automaker. Moreover, multiple equilibria might exist, some of them undesirable. We show that, both in the presence and absence of legacy insurance, an appropriate liability rule can induce optimal safety levels under the Nash setting. Our second question concerns itself with the role and welfare effects of the availability of legacy auto insurance in the age of infrastructure-assisted automated driving. Our analysis shows that the industry is not necessary for optimal coverage when the cost of accidents is known in advance and all possible accident scenarios are contractible. In fact, their presence can even harm safety, even though it ensures full coverage for accidents. When only insurance contracts with capped liability for automakers and ISSPs are available and in a monopolistic environment, legacy insurance potentially harms welfare. This highlights the important role of market structure in assessing the future of insurance in the age of automated driving and lays the groundwork for future investigations in this direction.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"191 ","pages":"Article 103115"},"PeriodicalIF":5.8,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637497","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":"Station-based, free-float, or hybrid: An operating mode analysis of a bike-sharing system","authors":"Chenyi Fu ,&nbsp;Ning Zhu ,&nbsp;Michael Pinedo ,&nbsp;Shoufeng Ma","doi":"10.1016/j.trb.2024.103105","DOIUrl":"10.1016/j.trb.2024.103105","url":null,"abstract":"<div><div>The profit-oriented bike-sharing industry, such as Mobike in China and Limebike in the USA, has widely adopted the free-float mode, which allows users to rent and return bikes without any restrictions with regard to stations. Compared to the traditional station-based mode, this new mode improves convenience and satisfies a variety of travel demands, but it also results in higher operating costs and lower number of available bikes (the number of bikes can be found). So far, no theoretical study has been done comparing the performance levels of the two different operating modes. Some bike-sharing firms are now attempting to design a hybrid operating mode that combines the advantages of the two modes. We design a mixed-integer program to model these three operating modes under different operating conditions. The model captures some of the new features of free-float bike-sharing systems. These new features include discounts for returning bikes to designated stations, different numbers of available bikes at stations and free-float areas, differences in station-based return levels as well as in convenience levels in the three operating modes. This study also considers the interactions between the free-float and station-based modes in meeting the demand and in managing relocation processes. Extensive numerical experiments are conducted and the results reveal that in more than half of the total cases under different parameter settings, the profits of the hybrid mode outperform the profits of the other two modes. The station-based mode is suitable for settings with high convenience levels, low number of available free-float bikes, and limited budgets for bike acquisitions, whereas the free-float mode can ensure high profits with low convenience levels and a large number of bikes being available. Our models can serve as a decision-making tool for bike-sharing firms in their selection of an optimal operating mode.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"191 ","pages":"Article 103105"},"PeriodicalIF":5.8,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637496","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":"Formulations and branch-and-cut algorithms for the heterogeneous fleet vehicle routing problem with soft time deadlines","authors":"Yulin Han,&nbsp;Hande Yaman","doi":"10.1016/j.trb.2024.103104","DOIUrl":"10.1016/j.trb.2024.103104","url":null,"abstract":"<div><div>This paper investigates a variant of the heterogeneous fleet vehicle routing problem (HVRP) that incorporates soft time deadlines for customers and allows for tardiness at penalty costs. Distinct vehicle types feature varying fixed usage costs and utilize different road networks, resulting in differences in both travel times and travel costs. The objective is to optimize fleet assignment and vehicle service routes to minimize the total fixed vehicle usage costs, routing variable costs, and tardiness costs, while ensuring each customer is visited exactly once and respecting route duration limits. To address this problem, we introduce three compact formulations: the Miller-Tucker-Zemlin formulation (MTZF), single-commodity flow formulation (SCFF), and two-commodity flow formulation (TCFF), comparing their linear programming (LP) relaxations. Additionally, we propose two new families of valid inequalities, in conjunction with generalized subtour elimination constraints, to strengthen these LP relaxations, integrating them into branch-and-cut solution schemes. The theoretical results on the comparison of formulations and the validity of the proposed inequalities hold also for other HVRPs with limited route duration. Computational experiments demonstrate the superior performance of SCFF and TCFF over MTZF, the effectiveness of the proposed valid inequalities in tightening formulations, and the enhanced computational efficiency achieved by incorporating them. Finally, we explore the impact of depot relocation, varying degrees of urgency in customer requests, and varying fixed vehicle usage costs on optimal solutions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103104"},"PeriodicalIF":5.8,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578861","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":"On dynamic fundamental diagrams: Implications for automated vehicles","authors":"Jiwan Jiang ,&nbsp;Yang Zhou ,&nbsp;Xin Wang ,&nbsp;Soyoung Ahn","doi":"10.1016/j.trb.2024.102979","DOIUrl":"10.1016/j.trb.2024.102979","url":null,"abstract":"<div><div>The traffic fundamental diagram (FD) describes the relationships among fundamental traffic variables of flow, density, and speed. FD represents fundamental properties of traffic streams, giving insights into traffic performance. This paper presents a theoretical investigation of dynamic FD properties, derived directly from vehicle car-following (control) models to model traffic hysteresis. Analytical derivation of dynamic FD is enabled by (i) frequency-domain representation of vehicle kinematics (acceleration, speed, and position) to derive vehicle trajectories based on transfer function and (ii) continuum approximation of density and flow, measured along the derived trajectories using Edie's generalized definitions. The formulation is generic: the derivation of dynamic FD is possible with any analytical car-following (control) laws for human-driven vehicles or automated vehicles (AVs). Numerical experiments shed light on the effects of the density-flow measurement region and car-following parameters on the dynamic FD properties for an AV platoon.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 102979"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594112","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":"A topological network connectivity design problem based on spectral analysis","authors":"Shoichiro Nakayama ,&nbsp;Shun-ichi Kobayashi ,&nbsp;Hiromichi Yamaguchi","doi":"10.1016/j.trb.2024.103012","DOIUrl":"10.1016/j.trb.2024.103012","url":null,"abstract":"<div><div>How to improve network connectivity and which parts of the network are vulnerable are critical issues. We begin by defining an equal distribution problem, in which supplies are distributed equally to all nodes in the network. We then derive a topological network connectivity measure from the convergence speed, which is the second minimum eigenvalue of a Laplacian network matrix. Based on the equal distribution problem, we propose a method for identifying critical links for network connectivity using the derivative of the second minimum eigenvalue. Furthermore, we develop a network design problem that maximizes topological connectivity within a budget creating strengthening network links. The problem is convex programming, and the solution is global. Furthermore, it can be converted into an identical semidefinite programming problem, which requires less computational effort. Finally, we test the developed problems on road networks in the Japanese prefectures of Ishikawa and Toyama to determine their applicability and validity.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 103012"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594070","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":"Optimizing OD-based up-front discounting strategies for enroute ridepooling services","authors":"Siying Wang ,&nbsp;Xiaolei Wang ,&nbsp;Chen Yang ,&nbsp;Xiaoning Zhang ,&nbsp;Wei Liu","doi":"10.1016/j.trb.2024.103013","DOIUrl":"10.1016/j.trb.2024.103013","url":null,"abstract":"<div><div>The technological progress in the recent decade has greatly facilitated the large-scale implementation of dynamic enroute ridepooling services, such as Uber Pool and DiDi Pinche. To sustain a profitable enroute ridepooling service, a well-designed discounting scheme is crucial. This paper focuses on the optimization of up-front discounting strategies for enroute ridepooling service, under which passengers are notified of origin–destination(OD)-based discount ratios together with estimated ride time before the start of their trips and enjoy the discounted prices no matter if they succeed or fail to get matched afterward. Assuming that ridepooling demand of each OD pair decreases with its price and the estimated waiting and ride time, we propose to optimize the discounting strategy of each OD pair through two methods. In the first method, the ridepooling price of each OD pair is optimized independently and adjusted day-to-day based on historical information; and in the second method, we optimize the prices of all OD pairs simultaneously, with the complex interactions among the expected ride and waiting times and the demand rates of all OD pairs being considered and captured by a system of nonlinear equations. The nonlinear and non-convex optimization problem of the second method is solved by two derivative-free algorithms: Bayesian optimization<span> and classification-based optimization. Based on a 15*15 grid network with 30 OD pairs and the real road network of Haikou (China), we conduct simulation experiments to examine the efficiency of the two algorithms and the system performance under different discounting strategies derived from the two methods. It is found that in comparison with a uniform discounting strategy, OD-based discounting strategies generated by both methods can bring about 3.84% more profit to the platform. In comparison with the independently optimized discounting strategies generated by the first method, the system optimal discounting strategy generated by the second method can further improve the platform profit by 5.55% and 2.71% on average in our grid-network and real road network experiments.</span></div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 103013"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594071","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":"Providing real-time en-route suggestions to CAVs for congestion mitigation: A two-way deep reinforcement learning approach","authors":"Xiaoyu Ma,&nbsp;Xiaozheng He","doi":"10.1016/j.trb.2024.103014","DOIUrl":"10.1016/j.trb.2024.103014","url":null,"abstract":"<div><div>This research investigates the effectiveness of information provision for congestion reduction in Connected Autonomous Vehicle (CAV) systems. The inherent advantages of CAVs, such as vehicle-to-everything communication, advanced vehicle autonomy<span>, and reduced human involvement, make them conducive to achieving Correlated Equilibrium<span> (CE). Leveraging these advantages, this research proposes a reinforcement learning framework involving CAVs and an information provider, where CAVs conduct real-time learning to minimize their individual travel time, while the information provider offers real-time route suggestions aiming to minimize the system’s total travel time. The en-route routing problem<span> of the CAVs is formulated as a Markov game and the information provision problem is formulated as a single-agent Markov decision process<span>. Then, this research develops a customized two-way deep reinforcement learning approach to solve the interrelated problems, accounting for their unique characteristics. Moreover, CE has been formulated within the proposed framework. Theoretical analysis rigorously proves the realization of CE and that the proposed framework can effectively mitigate congestion without compromising individual user optimality. Numerical results demonstrate the effectiveness of this approach. Our research contributes to the advancement of congestion reduction strategies in CAV systems with the mitigation of the conflict between system-level and individual-level goals using CE as a theoretical foundation. The results highlight the potential of information provision in fostering coordination and correlation among CAVs, thereby enhancing traffic efficiency and achieving system-level goals in smart transportation.</span></span></span></span></div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 103014"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594072","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":"Bridging the gap between micro-economics and micro-mobility: A two-dimensional risk-based microscopic model of pedestrians’ and bicyclists’ operational behaviors","authors":"Mohaiminul Haque ,&nbsp;Samer H. Hamdar ,&nbsp;Alireza Talebpour","doi":"10.1016/j.trb.2024.103021","DOIUrl":"10.1016/j.trb.2024.103021","url":null,"abstract":"<div><div>Due to the inherent safety concerns associated with traffic movement in unconstrained two-dimensional settings, it is important that pedestrians’ and other modes’ movements such as bicyclists are modeled as a risk-taking stochastic dynamic process that may lead to errors and thus contacts and collisions. Among the existing models that may capture risk-taking behaviors are: 1) the social force models (through the interplay of the repulsion and the attraction force parameters); 2) and the discrete-choice models (through the rationality or the bounded rationality paradigm while weighing different alternatives). Given that the social force models may not readily capture the contact/collision dynamics through the Newtonian force framework, decision-making theories are hypothesized as a feasible approach to formulate a new model that can account for cognitive and behavioral dimensions such as uncertainty and risk. However, instead of relying on the bounded rationality theory, in this paper, a generalized Prospect Theory based microsimulation model is proposed. The model relies on the micro-economics Prospect Theory paradigm where pedestrians or bicyclists (i.e., micro-mobility users) evaluate their speed and directional alternatives while considering the possibility of colliding with other obstacles/users. A numerical analysis on the main model parameters is presented. The model is then calibrated and validated using two real-world data sets with trajectories recorded in naturalistic settings. With the calibrated parameters studied, simulation exercises and sensitivity analysis are conducted to recreate bottlenecks and lane formations in different conditions. The findings show that the proposed model's parameters reflect the risk-taking tendencies of different roadway users in mixed right-of-way's environments while showing realistic microscopic and macroscopic traffic flow characteristics.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 103021"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594074","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":"A generalized rationally inattentive route choice model with non-uniform marginal information costs","authors":"Bo Zhou ,&nbsp;Ronghui Liu","doi":"10.1016/j.trb.2024.102993","DOIUrl":"10.1016/j.trb.2024.102993","url":null,"abstract":"<div><div>Information consumes attention. In the information-rich society, a wealth of information can support decision-making, but it can also create poverty of attention to and inability to make the best use of information. This study applies the theory of rational inattention in modelling traveller’s route choice behaviour, where the attention (costs) to information is non-uniform. We establish the mathematical formulation of a generalized rationally inattentive route choice model with non-uniform marginal information costs, and prove that the optimal conditional route choice probabilities for all the routes always locate within the interior of the feasible region of the route choice model. Based on this property, we analytically characterize the closed-form expression of the optimal conditional choice probabilities, and devise an efficient iterative solution algorithm to compute them. Finally, two numerical examples are conducted to demonstrate the theoretical properties of the rationally inattentive route choice behaviour. This behavioural modelling approach provides an insight on how the rationally inattentive travellers spontaneously learn the optimal route choice from the acquired information.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"189 ","pages":"Article 102993"},"PeriodicalIF":5.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594051","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}