Transp. Sci.最新文献_第9页

A Data-Driven Method for Reconstructing a Distribution from a Truncated Sample with an Application to Inferring Car-Sharing Demand 截断样本重构分布的数据驱动方法及其在汽车共享需求推断中的应用

Transp. Sci. Pub Date : 2021-02-17 DOI: 10.1287/TRSC.2020.1028

Evan Fields, C. Osorio, Tianli Zhou

引用次数: 11

A Strategic Markovian Traffic Equilibrium Model for Capacitated Networks 有能力网络的策略马尔可夫流量均衡模型

Transp. Sci. Pub Date : 2021-02-17 DOI: 10.1287/TRSC.2020.1033

Maëlle Zimmermann, Emma Frejinger, P. Marcotte

引用次数: 6

Acyclic Mechanism Design for Freight Consolidation 货物集运的非循环机构设计

Transp. Sci. Pub Date : 2021-02-15 DOI: 10.1287/TRSC.2020.1031

Wentao Zhang, Nelson A. Uhan, M. Dessouky, A. Toriello

{"title":"Acyclic Mechanism Design for Freight Consolidation","authors":"Wentao Zhang, Nelson A. Uhan, M. Dessouky, A. Toriello","doi":"10.1287/TRSC.2020.1031","DOIUrl":"https://doi.org/10.1287/TRSC.2020.1031","url":null,"abstract":"Freight consolidation is a logistics practice that improves the cost-effectiveness and efficiency of transportation operations, and also reduces energy consumption and carbon footprint. A “fair” shipping cost-sharing scheme is indispensable to help establish and sustain the cooperation of a group of suppliers in freight consolidation. In this paper, we design a truthful acyclic mechanism to solve the cost-sharing problem in a freight consolidation system with one consolidation center and one common destination. Applying the acyclic mechanism, the consolidation center decides which suppliers’ demands ship via the consolidation center and their corresponding cost shares based on their willingness to pay for the service. The proposed acyclic mechanism is designed based on bin packing solutions that are also strong Nash equilibria for a related noncooperative game. We study the budget-balance of the mechanism both theoretically and numerically. We prove a 2-budget-balance guarantee for the mechanism in general and better budget-balance guarantees under specific problem settings. Empirical tests on budget-balance show that our mechanism performs much better than the guaranteed budget-balance ratio. We also study the economic efficiency of our mechanism numerically to investigate its impact on social welfare under different conditions.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"9 1","pages":"571-584"},"PeriodicalIF":0.0,"publicationDate":"2021-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81261216","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}

引用次数: 2

Exact Methods for the Traveling Salesman Problem with Drone 带无人机的旅行商问题的精确方法

Transp. Sci. Pub Date : 2021-02-05 DOI: 10.1287/trsc.2020.1017

R. Roberti, Mario Ruthmair

{"title":"Exact Methods for the Traveling Salesman Problem with Drone","authors":"R. Roberti, Mario Ruthmair","doi":"10.1287/trsc.2020.1017","DOIUrl":"https://doi.org/10.1287/trsc.2020.1017","url":null,"abstract":"Efficiently handling last-mile deliveries becomes more and more important nowadays. Using drones to support classical vehicles allows improving delivery schedules as long as efficient solution methods to plan last-mile deliveries with drones are available. We study exact solution approaches for some variants of the traveling salesman problem with drone (TSP-D) in which a truck and a drone are teamed up to serve a set of customers. This combination of truck and drone can exploit the benefits of both vehicle types: the truck has a large capacity but usually low travel speed in urban areas; the drone is faster and not restricted to street networks, but its range and carrying capacity are limited. We propose a compact mixed-integer linear program (MILP) for several TSP-D variants that is based on timely synchronizing truck and drone flows; such an MILP is easy to implement but nevertheless leads to competitive results compared with the state-of-the-art MILPs. Furthermore, we introduce dynamic programming recursions to model several TSP-D variants. We show how these dynamic programming recursions can be exploited in an exact branch-and-price approach based on a set partitioning formulation using ng-route relaxation and a three-level hierarchical branching. The proposed branch-and-price can solve instances with up to 39 customers to optimality outperforming the state-of-the-art by more than doubling the manageable instance size. Finally, we analyze different scenarios and show that even a single drone can significantly reduce a route’s completion time when the drone is sufficiently fast.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"1 1","pages":"315-335"},"PeriodicalIF":0.0,"publicationDate":"2021-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75937518","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}

引用次数: 89

Real-Time Forecasting of Metro Origin-Destination Matrices with High-Order Weighted Dynamic Mode Decomposition 基于高阶加权动态模态分解的地铁始发-目的地矩阵实时预测

Transp. Sci. Pub Date : 2021-01-02 DOI: 10.1287/trsc.2022.1128

Zhanhong Cheng, M. Trépanier, Lijun Sun

{"title":"Real-Time Forecasting of Metro Origin-Destination Matrices with High-Order Weighted Dynamic Mode Decomposition","authors":"Zhanhong Cheng, M. Trépanier, Lijun Sun","doi":"10.1287/trsc.2022.1128","DOIUrl":"https://doi.org/10.1287/trsc.2022.1128","url":null,"abstract":"Forecasting short-term ridership of different origin-destination pairs (i.e., OD matrix) is crucial to the real-time operation of a metro system. However, this problem is notoriously difficult due to the large-scale, high-dimensional, noisy, and highly skewed nature of OD matrices. In this paper, we address the short-term OD matrix forecasting problem by estimating a low-rank high-order vector autoregression (VAR) model. We reconstruct this problem as a data-driven reduced-order regression model and estimate it using dynamic mode decomposition (DMD). The VAR coefficients estimated by DMD are the best-fit (in terms of Frobenius norm) linear operator for the rank-reduced full-size data. To address the practical issue that metro OD matrices cannot be observed in real time, we use the boarding demand to replace the unavailable OD matrices. Moreover, we consider the time-evolving feature of metro systems and improve the forecast by exponentially reducing the weights for historical data. A tailored online update algorithm is then developed for the high-order weighted DMD model (HW-DMD) to update the model coefficients at a daily level, without storing historical data or retraining. Experiments on data from two large-scale metro systems show that the proposed HW-DMD is robust to noisy and sparse data, and significantly outperforms baseline models in forecasting both OD matrices and boarding flow. The online update algorithm also shows consistent accuracy over a long time, allowing us to maintain an HW-DMD model at much low costs.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"36 1","pages":"904-918"},"PeriodicalIF":0.0,"publicationDate":"2021-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86621015","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}

引用次数: 22

Multiclass Traffic Flow Dynamics: An Endogenous Model 多类交通流动力学:一个内生模型

Transp. Sci. Pub Date : 2021-01-01 DOI: 10.1287/trsc.2020.1015

K. Yuan, H. Lo

{"title":"Multiclass Traffic Flow Dynamics: An Endogenous Model","authors":"K. Yuan, H. Lo","doi":"10.1287/trsc.2020.1015","DOIUrl":"https://doi.org/10.1287/trsc.2020.1015","url":null,"abstract":"Vehicles on roads can be distinguished, each defined by its own set of properties (e.g., fleet length and free-flow speed). The traffic states on roads can be attributed to the longitudinal heterogeneity in vehicles. Vehicles slower than prevailing vehicles are defined as moving bottlenecks. On a multilane road section with multiple vehicle types, slower vehicles create moving bottlenecks and induce overtaking by faster vehicles so as to maintain their higher desired speed. The influence of single-class moving bottlenecks has been studied in the past. However, the impacts of multiple classes of moving bottlenecks have not yet been fully explored. This paper categorizes vehicles into passenger cars, medium trucks, and heavy trucks. By defining medium trucks and heavy trucks as moving bottlenecks, we develop analytical formulas for the fundamental diagram on a multilane road section with heterogeneous moving bottlenecks. The formula confirms that the composition of traffic and the longest truck platoon length influence the fundamental diagram. We then conduct simulations using a first-order kinematic wave model in Lagrangian coordinates to validate the fundamental diagram developed with the analytical formula and obtain promising results. This study provides fundamental knowledge for multiclass traffic modeling and multilane traffic operations.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"95 1","pages":"456-474"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89153211","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}

引用次数: 3

A Compact Arc-Based ILP Formulation for the Pickup and Delivery Problem with Divisible Pickups and Deliveries 具有可分取货和交货的取货问题的一个紧凑的基于弧的ILP公式

Transp. Sci. Pub Date : 2021-01-01 DOI: 10.1287/trsc.2020.1016

Bolor Jargalsaikhan, Ward Romeijnders, K. J. Roodbergen

{"title":"A Compact Arc-Based ILP Formulation for the Pickup and Delivery Problem with Divisible Pickups and Deliveries","authors":"Bolor Jargalsaikhan, Ward Romeijnders, K. J. Roodbergen","doi":"10.1287/trsc.2020.1016","DOIUrl":"https://doi.org/10.1287/trsc.2020.1016","url":null,"abstract":"We consider the capacitated single vehicle one-to-one pickup and delivery problem with divisible pickups and deliveries (PDPDPD). In this problem, we do not make the standard assumption of one-to-one pickup and delivery problems (PDPs) that each location has only one transportation request. Instead we assume there are multiple requests per location that may be performed individually. This may result in multiple visits to a location. We provide a new compact arc-based integer linear programming (ILP) formulation for the PDPDPD by deriving time-consistency constraints that identify the order in which selected outgoing arcs from a node are actually traversed. The formulation can also easily be applied to the one-to-one PDP by restricting the number of times that a node can be visited. Numerical results on standard one-to-one PDP test instances from the literature show that our compact formulation is almost competitive with tailor-made solution methods for the one-to-one PDP. Moreover, we observe that significant cost savings of up to 15% on average may be obtained by allowing divisible pickups and deliveries in one-to-one PDPs. It turns out that divisible pickups and deliveries are not only beneficial when the vehicle capacity is small, but also when this capacity is unrestrictive.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"1 1","pages":"336-352"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76513788","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}

引用次数: 2

The Robust Vehicle Routing Problem with Time Window Assignments 具有时间窗分配的鲁棒车辆路径问题

Transp. Sci. Pub Date : 2021-01-01 DOI: 10.1287/trsc.2020.1013

M. Hoogeboom, Y. Adulyasak, W. Dullaert, Patrick Jaillet

{"title":"The Robust Vehicle Routing Problem with Time Window Assignments","authors":"M. Hoogeboom, Y. Adulyasak, W. Dullaert, Patrick Jaillet","doi":"10.1287/trsc.2020.1013","DOIUrl":"https://doi.org/10.1287/trsc.2020.1013","url":null,"abstract":"In practice, there are several applications in which logistics service providers determine the service time windows at the customers, for example, in parcel delivery, retail, and repair services. These companies face uncertain travel times and service times that have to be taken into account when determining the time windows and routes prior to departure. The objective of the proposed robust vehicle routing problem with time window assignments (RVRP-TWA) is to simultaneously determine routes and time window assignments such that the expected travel time and the risk of violating the time windows are minimized. We assume that the travel time probability distributions are not completely known but that some statistics, such as the mean, minimum, and maximum, can be estimated. We extend the robust framework based on the requirements’ violation index, which was originally developed for the case where the specific requirements (time windows) are given as inputs, to the case where they are also part of the decisions. The subproblem of finding the optimal time window assignment for the customers in a given route is shown to be convex, and the subgradients can be derived. The RVRP-TWA is solved by iteratively generating subgradient cuts from the subproblem that are added in a branch-and-cut fashion. Experiments address the performance of the proposed solution approach and examine the trade-off between expected travel time and risk of violating the time windows.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"64 1","pages":"395-413"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84833841","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}

引用次数: 15

Credit-Based Mobility Management Considering Travelers' Budgeting Behaviors Under Uncertainty 考虑不确定性下出行者预算行为的基于信用的出行管理

Transp. Sci. Pub Date : 2021-01-01 DOI: 10.1287/trsc.2020.1014

Xi Lin, Yafeng Yin, Fang He

{"title":"Credit-Based Mobility Management Considering Travelers' Budgeting Behaviors Under Uncertainty","authors":"Xi Lin, Yafeng Yin, Fang He","doi":"10.1287/trsc.2020.1014","DOIUrl":"https://doi.org/10.1287/trsc.2020.1014","url":null,"abstract":"This study analyzes the performance of a credit-based mobility management scheme considering travelers’ budgeting behaviors for credit consumption under uncertainty. In the scheme, government agencies periodically distribute a certain number of credits to travelers; travelers must pay a credit charge for driving to complete their trips. Otherwise, they can take public transit free of credit charge. Consequently, within a credit-releasing cycle, travelers must budget their credit consumption to fulfill their mobility needs. Such budgeting behaviors can be viewed as a multistage decision-making process under uncertainty. Considering a transportation system with a credit scheme, we propose parsimonious models to investigate how the uncertainty associated with individual mobility needs and the subsequent travelers’ credit-budgeting behavior influence the multistage equilibrium of the transportation system, as well as the performance of the credit scheme on managing the transportation system. Both analytical and numerical results suggest that travelers tend to restrict their credit consumption in the early stage of a credit-releasing cycle to hedge against the risks associated with using up all credits, which compromises the performances of credit-based schemes. Moreover, a negative attitude toward risk aggravates the discrepancy between the credit consumption of the early and late stages. Last, we propose a contingency credit scheme to mitigate the negative impact incurred by travelers’ budgeting behaviors.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"27 1","pages":"297-314"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85926939","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}

引用次数: 4

Impact of Information on Topology-Induced Traffic Oscillations 信息对拓扑交通振荡的影响

Transp. Sci. Pub Date : 2021-01-01 DOI: 10.1287/trsc.2020.1032

Yanhong Wang, R. Jiang, Y. Nie, Ziyou Gao

引用次数: 2