Transportation Research Part B-Methodological最新文献

{"title":"A novel data fusion method to leverage passively-collected mobility data in generating spatially-heterogeneous synthetic population","authors":"Khoa D. Vo ,&nbsp;Eui-Jin Kim ,&nbsp;Prateek Bansal","doi":"10.1016/j.trb.2024.103128","DOIUrl":"10.1016/j.trb.2024.103128","url":null,"abstract":"<div><div>Conventional methods to synthesize population use household travel survey (HTS) data. They generate many infeasible attribute values due to sequentially generating sociodemographics and spatial attributes and encounter a low spatial heterogeneity issue due to a low sampling rate of the HTS data. Passively collected mobility (PCM) data (e.g., cellular traces) provides extensive spatial coverage but poses integration challenges with HTS data due to differences in spatial resolution and attributes. This study introduces a novel cluster-based data fusion method to address these limitations and simultaneously generate synthetic populations with accurate sociodemographics and home–work locations at high spatial heterogeneity. Spatial clustering is adopted to align the spatial resolution of HTS and PCM data, facilitating effective data integration. The data fusion process is reformulated into cluster-specific low-dimensional optimization subproblems to ensure computational tractability. Analytical properties are derived to retain essential distributional characteristics from both datasets in the fused distribution. The spatial clustering process is optimized to ensure such distributional consistencies while maintaining a balance between feasibility and heterogeneity of the synthetic population. The data fusion properties are validated using HTS and LTE/5G cellular signaling data from Seoul, South Korea. Validation against census data confirms the method’s efficacy in maintaining distributional consistency while increasing spatial heterogeneity, with 97% of the generated population being unobserved in the HTS data. This research advances methods to synthesize a population by leveraging the complementary strengths of HTS and PCM data, providing a robust framework for generating spatially diverse synthetic populations essential for urban planning.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"191 ","pages":"Article 103128"},"PeriodicalIF":5.8,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142700834","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":"The drone scheduling problem in shore-to-ship delivery: A time discretization-based model with an exact solving approach","authors":"Ying Yang,&nbsp;Xiaodeng Hao,&nbsp;Shuaian Wang","doi":"10.1016/j.trb.2024.103117","DOIUrl":"10.1016/j.trb.2024.103117","url":null,"abstract":"<div><div>Amid growing interest in the integration of drones into maritime logistics, this paper addresses the drone scheduling problem in shore-to-ship delivery (DSP-SSD), which is both significant and challenging. We introduce a mixed-integer programming model with time discretization that incorporates drone-related constraints, moving targets, and the need for multiple drone trips. While commercial solvers can handle this model in small-scale scenarios, we propose a tailored branch-and-price-and-cut (BPC) algorithm for larger and more complex cases. This algorithm integrates a drone-specific backward labeling algorithm, cutting planes, and acceleration methods to boost its effectiveness. Experiments show that the BPC algorithm substantially outperforms the commercial solvers in terms of solution quality and computational efficiency and that the inclusion of acceleration strategies in the algorithm enhances its performance. We also provide detailed sensitivity analyses of critical parameters of the model, such as the time discretization parameter and the number of ships, to gain insights into how our approach could be applied in real-world DSP-SSD operations.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"191 ","pages":"Article 103117"},"PeriodicalIF":5.8,"publicationDate":"2024-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142700832","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":"Modelling the impacts of en-route ride-pooling service in a mixed pooling and non-pooling market","authors":"Jun Wang ,&nbsp;Manzi Li ,&nbsp;Xiaolei Wang ,&nbsp;Hai Yang","doi":"10.1016/j.trb.2024.103106","DOIUrl":"10.1016/j.trb.2024.103106","url":null,"abstract":"<div><div>En-route ride-pooling services, e.g. Didi Pinche, UberPool, have been considered a promising way to alleviate traffic congestion during rush hours. Yet in reality, its market share is still small compared to non-pooling service. For a ride-hailing platform that provides both en-route pooling and non-pooling services, this paper endeavors to answer under what circumstance would it have incentive to encourage ride-pooling, and whether drivers, riders, the platform and the society can simultaneously benefit from the introduction of en-route ride-pooling service. We propose an aggregate model to characterize the equilibrium of a ride-hailing market where a platform operates a fleet of vehicles to provide en-route pooling and non-pooling services. The model captures the complex interactions among riders’ mode choices between pooling and non-pooling, the waiting times of pooling and non-pooling users, the pairing probability and the expected detour time of pooling users, the matching rates of cruising and halfly occupied vehicles with different types of riders, and the numbers of cruising, halfly occupied and fully occupied vehicles at each instant. Based on the model, we theoretically reveal the impacts of the total ride-hailing demand, vehicle fleet size, and the platform’s pricing and vehicle dispatching strategies on the market equilibrium performance through partial derivative-based sensitivity analysis, and establish conditions under which the introduction of en-route ride-pooling service improves platform profit, driver income, rider utility and social welfare.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"191 ","pages":"Article 103106"},"PeriodicalIF":5.8,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142684336","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":"Amachine learning technique embedded reference-dependent choice model for explanatory power improvement: Shifting of reference point as a key factor in vehicle purchase decision-making","authors":"Kyungah Kim ,&nbsp;Jinseok Kim ,&nbsp;Subin Park ,&nbsp;Jongsu Lee ,&nbsp;Junghun Kim","doi":"10.1016/j.trb.2024.103130","DOIUrl":"10.1016/j.trb.2024.103130","url":null,"abstract":"<div><div>Machine learning is a powerful tool with the potential to improve a choice model's ability to explain consumer behavior. Although the reference-dependent choice model, developed with an emphasis on real decision-making processes, has an advantage over general discrete choice models in terms of explanatory power and interpretability, there is still a lack of consensus on how the reference point should be set. Currently, the common practice is to design a reference point-based utility equation to make an arbitrary decision between past experience, the status quo, and future expectations as the reference point. However, as individual consumers may differ from researchers in how they set their reference points, the current method is rather limited for understanding consumer choice behavior. Therefore, this study proposes a new approach to more accurately understand consumer choice behavior by shifting individual reference points using ANNs (Artificial Neural Networks). The analysis results show that the model proposed in this study has better explanatory power than both the discrete choice model and the existing reference-dependent choice model. This implies that the reference point typically set by researchers approximates each individual's actual reference point through artificial neural networks. This study is significant in that it confirms the possibility that the current status, which showed the highest model fit among several reference price proxy candidates in vehicle choice, may not function as the actual reference price, while also proposing a foundational framework for identifying each consumer's true reference price. Furthermore, it can contribute to corporate strategies and government policy recommendations based on consumer preference analysis, where high explanatory power is required.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"191 ","pages":"Article 103130"},"PeriodicalIF":5.8,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142684361","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":"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}