Transportation Science最新文献_第2页

Correction to the Paper “Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows” 对论文 "具有时间窗口的时间相关车辆路由问题的分支和价格 "的更正

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-08-06 DOI: 10.1287/trsc.2024.erratum.v58.n5

Said Dabia, Stefan Ropke, Tom van Woensel

引用次数: 0

Dynamic Operations of a Mobile Charging Crowdsourcing Platform 移动充电众包平台的动态运营

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-08-05 DOI: 10.1287/trsc.2023.0126

Yiming Yan, Xi Lin, Fang He, David Z. W. Wang

{"title":"Dynamic Operations of a Mobile Charging Crowdsourcing Platform","authors":"Yiming Yan, Xi Lin, Fang He, David Z. W. Wang","doi":"10.1287/trsc.2023.0126","DOIUrl":"https://doi.org/10.1287/trsc.2023.0126","url":null,"abstract":"This paper investigates the operation of a novel electric vehicles (EVs) charging service mode, that is, crowdsourced mobile charging service for EVs, whereby a crowdsourcing platform is established to arrange suppliers (crowdsourced chargers) to deliver charging service to customers’ electric vehicles (parked EVs) at low-battery levels. From the platform operator’s perspective, we aim to determine the optimal operation strategies for mobile charging crowdsourcing platforms to achieve specific objectives. A mathematical modeling framework is developed to capture the interactions among supply, demand, and service operations in the crowdsourced mobile charging market. To design an efficient solution method to solve the formulated model, we first analyze the model properties by rigorously proving that a crucial variable set for operating the mobile charging crowdsourcing system includes charging price, commission control, and period-specific aggregate demand control. Besides, we provide both an equivalent condition and a necessary condition for checking the feasibility of these crucial variables. On top of this, we construct a search tree according to the operation periods in a day to solve the optimal operation strategies, wherein a nondominated principle is adopted as an accelerating technique in the searching process. The solution obtained from the proposed solution algorithm is proved to be sufficiently close to the actual global optimal solutions of the formulated model up to the resolution of the discretization scheme adopted. Numerical examples provide evidence verifying the model’s validity and the solution method’s efficiency. Overall, the research outcome of this work can offer service operators structured and valuable guidelines for operating mobile charging crowdsourcing platforms.Funding: This work was supported by the Singapore Ministry of Education [Grant RG124/21].Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2023.0126 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"30 1","pages":""},"PeriodicalIF":4.6,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Destroying Phantom Jams with Connectivity and Automation: Nonlinear Dynamics and Control of Mixed Traffic 用连通性和自动化摧毁 "幽灵堵车"：混合交通的非线性动力学与控制

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-07-24 DOI: 10.1287/trsc.2023.0498

Tamas G. Molnar, Gábor Orosz

{"title":"Destroying Phantom Jams with Connectivity and Automation: Nonlinear Dynamics and Control of Mixed Traffic","authors":"Tamas G. Molnar, Gábor Orosz","doi":"10.1287/trsc.2023.0498","DOIUrl":"https://doi.org/10.1287/trsc.2023.0498","url":null,"abstract":"Connected automated vehicles (CAVs) have the potential to improve the efficiency of vehicular traffic. In this paper, we discuss how CAVs can positively impact the dynamic behavior of mixed traffic systems on highways through the lens of nonlinear dynamics theory. First, we show that human-driven traffic exhibits a bistability phenomenon, in which the same drivers can both drive smoothly or cause congestion, depending on perturbations like a braking of an individual driver. As such, bistability can lead to unexpected phantom traffic jams, which are undesired. By analyzing the corresponding nonlinear dynamical model, we explain the mechanism of bistability and identify which human driver parameters may cause it. Second, we study mixed traffic that includes both human drivers and CAVs, and we analyze how CAVs affect the nonlinear dynamic behavior. We show that a large-enough penetration of CAVs in the traffic flow can eliminate bistability, and we identify the controller parameters of CAVs that are able to do so. Ultimately, this helps to achieve stable and smooth mobility on highways.History: This paper has been accepted for the Transportation Science Special Issue on ISTTT25 Conference.Funding: This work was supported by the University of Michigan’s Center for Connected and Automated Transportation [U.S. DOT Grant 69A3551747105].Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0498 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"17 1","pages":""},"PeriodicalIF":4.6,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141773800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Facility Location Problem: Modeling Joint Disruptions Using Subordination 设施选址问题：利用从属关系建立联合干扰模型

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-07-22 DOI: 10.1287/trsc.2023.0103

Vishwakant Malladi, Kumar Muthuraman

{"title":"Facility Location Problem: Modeling Joint Disruptions Using Subordination","authors":"Vishwakant Malladi, Kumar Muthuraman","doi":"10.1287/trsc.2023.0103","DOIUrl":"https://doi.org/10.1287/trsc.2023.0103","url":null,"abstract":"We study the facility location problem with disruptions where the objective is to choose a set of locations that minimizes the sum of expected servicing and setup costs. Disruptions can affect multiple locations simultaneously and are caused by multiple factors like geography, supply chain characteristics, politics, and ownership. Accounting for the various factors when modeling disruptions is challenging due to a large number of required parameters, the lack of calibration methodologies, the sparsity of disruption data, and the number of scenarios to be considered in the optimization. Because of these reasons, existing models neglect dependence or prespecify the dependence structures. Using partially subordinated Markov chains, we present a comprehensive approach that starts from disruption data, models dependencies, calibrates the disruption model, and optimizes location choices. We construct a metric and a calibration algorithm that learns from the data the strength of dependence, the number of necessary factors (subordinators), and the locations each subordinator affects. We prove that our calibration approach yields consistent estimates of the model parameters. Then, we introduce a variant of the standard approach to the underlying optimization problem, which leverages partially subordinated Markov chains to solve it quickly and precisely. Finally, we demonstrate the efficacy of our approach using twelve different disruption data sets. Our calibrated parameters are robust, and our optimization algorithm performs better than the simulation-based algorithm. The solutions from our model for disruptions have lower costs than those from other disruption models. Our approach allows for better modeling of disruptions from historical data and can be adapted to other problems in logistics, like the hub location, capacitated facility location, and so on., with joint disruptions.Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0103 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"65 1","pages":""},"PeriodicalIF":4.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141754114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Paradox of Telecommuting and Staggered Work Hours in the Bottleneck Model 瓶颈模式中的远程办公和错开工作时间悖论

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-07-22 DOI: 10.1287/trsc.2024.0520

Takara Sakai, Takashi Akamatsu, Koki Satsukawa

{"title":"A Paradox of Telecommuting and Staggered Work Hours in the Bottleneck Model","authors":"Takara Sakai, Takashi Akamatsu, Koki Satsukawa","doi":"10.1287/trsc.2024.0520","DOIUrl":"https://doi.org/10.1287/trsc.2024.0520","url":null,"abstract":"We study the long- and short-term effects of telecommuting (TLC), staggered work hours (SWH), and their combined scheme on peak-period congestion and location patterns. In order to enable a unified comparison of the schemes’ long- and short-term effects, we develop a novel equilibrium analysis approach that consistently synthesizes the long-term equilibrium (location and percentage of telecommuting choice) and short-term equilibrium (preferred arrival time and departure time choice). By exploiting their special mathematical structures similar to optimal transport problems, we derive the closed-form solution to the long- and short-term equilibrium while explicitly considering their interaction. These closed-form solutions elucidate the discrepancies between the effects of each scheme and uncover a paradoxical finding: the introduction of SWH, in conjunction with TLC, may increase the total commuting costs compared with the scenario with only TLC, without yielding any improvement in worker utility.History: This paper has been accepted for the Transportation Science Special Issue on ISTTT25 Conference.Funding: This work was supported by Council for Science, Technology and Innovation (CSTI), Cross-ministerial Strategic Innovation Promotion Program (SIP), the 3rd period of SIP “Smart Infrastructure Management System” [Grant JPJ012187] (Funding agency: PublicWorks Research Institute, Japan). This work was also supported by Japan Society for the Promotion of Science (JSPS) KAKENHI [Grants JP20J21744, JP21H01448, JP24K00999, JP20K14843, and JP23K13418] and the Support Program for Urban Studies of the Obayashi Foundation.Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0520 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"1 1","pages":""},"PeriodicalIF":4.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141754141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice 沃德洛普均衡可以是有界理性的：路线选择的新行为理论

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-07-19 DOI: 10.1287/trsc.2023.0132

Jiayang Li, Zhaoran Wang, Yu (Marco) Nie

{"title":"Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice","authors":"Jiayang Li, Zhaoran Wang, Yu (Marco) Nie","doi":"10.1287/trsc.2023.0132","DOIUrl":"https://doi.org/10.1287/trsc.2023.0132","url":null,"abstract":"As one of the most fundamental concepts in transportation science, Wardrop equilibrium (WE) has always had a relatively weak behavioral underpinning. To strengthen this foundation, one must reckon with bounded rationality in human decision-making processes, such as the lack of accurate information, limited computing power, and suboptimal choices. This retreat from behavioral perfectionism in the literature, however, was typically accompanied by a conceptual modification of WE. Here, we show that giving up perfect rationality need not force a departure from WE. On the contrary, WE can be reached with global stability in a routing game played by boundedly rational travelers. We achieve this result by developing a day-to-day (DTD) dynamical model that mimics how travelers gradually adjust their route valuations, hence choice probabilities, based on past experiences. Our model, called cumulative logit (CumLog), resembles the classical DTD models but makes a crucial change; whereas the classical models assume that routes are valued based on the cost averaged over historical data, our model values the routes based on the cost accumulated. To describe route choice behaviors, the CumLog model only uses two parameters, one accounting for the rate at which the future route cost is discounted in the valuation relative to the past ones and the other describing the sensitivity of route choice probabilities to valuation differences. We prove that the CumLog model always converges to WE, regardless of the initial point, as long as the behavioral parameters satisfy certain mild conditions. Our theory thus upholds WE’s role as a benchmark in transportation systems analysis. It also explains why equally good routes at equilibrium may be selected with different probabilities, which solves the instability problem posed by Harsanyi.Funding: This research is funded by the National Science Foundation [Grants CMMI #2225087 and ECCS #2048075].Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0132 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"39 1","pages":""},"PeriodicalIF":4.6,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141745355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The Vehicle Routing Problem with Access Restrictions 有访问限制的车辆路由问题

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-07-18 DOI: 10.1287/trsc.2023.0261

Munise Kübra Şahin, Hande Yaman

引用次数: 0

Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates 随机和动态发布日期定向问题的强化学习方法

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-07-18 DOI: 10.1287/trsc.2022.0366

Yuanyuan Li, Claudia Archetti, Ivana Ljubić

{"title":"Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates","authors":"Yuanyuan Li, Claudia Archetti, Ivana Ljubić","doi":"10.1287/trsc.2022.0366","DOIUrl":"https://doi.org/10.1287/trsc.2022.0366","url":null,"abstract":"In this paper, we study a sequential decision-making problem faced by e-commerce carriers related to when to send out a vehicle from the central depot to serve customer requests and in which order to provide the service, under the assumption that the time at which parcels arrive at the depot is stochastic and dynamic. The objective is to maximize the expected number of parcels that can be delivered during service hours. We propose two reinforcement learning (RL) approaches for solving this problem. These approaches rely on a look-ahead strategy in which future release dates are sampled in a Monte Carlo fashion, and a batch approach is used to approximate future routes. Both RL approaches are based on value function approximation: One combines it with a consensus function (VFA-CF) and the other one with a two-stage stochastic integer linear programming model (VFA-2S). VFA-CF and VFA-2S do not need extensive training as they are based on very few hyperparameters and make good use of integer linear programming (ILP) and branch-and-cut–based exact methods to improve the quality of decisions. We also establish sufficient conditions for partial characterization of optimal policy and integrate them into VFA-CF/VFA-2S. In an empirical study, we conduct a competitive analysis using upper bounds with perfect information. We also show that VFA-CF and VFA-2S greatly outperform alternative approaches that (1) do not rely on future information (2) are based on point estimation of future information, (3) use heuristics rather than exact methods, or (4) use exact evaluations of future rewards.Funding: This work was supported by the CY Initiative of Excellence [ANR-16- IDEX-0008].Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2022.0366 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"52 1","pages":""},"PeriodicalIF":4.6,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141746420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Inverse Optimization for Routing Problems 路由问题的逆向优化

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-07-17 DOI: 10.1287/trsc.2023.0241

Pedro Zattoni Scroccaro, Piet van Beek, Peyman Mohajerin Esfahani, Bilge Atasoy

{"title":"Inverse Optimization for Routing Problems","authors":"Pedro Zattoni Scroccaro, Piet van Beek, Peyman Mohajerin Esfahani, Bilge Atasoy","doi":"10.1287/trsc.2023.0241","DOIUrl":"https://doi.org/10.1287/trsc.2023.0241","url":null,"abstract":"We propose a method for learning decision makers’ behavior in routing problems using inverse optimization (IO). The IO framework falls into the supervised learning category and builds on the premise that the target behavior is an optimizer of an unknown cost function. This cost function is to be learned through historical data, and in the context of routing problems, can be interpreted as the routing preferences of the decision makers. In this view, the main contributions of this study are to propose an IO methodology with a hypothesis function, loss function, and stochastic first-order algorithm tailored to routing problems. We further test our IO approach in the Amazon Last Mile Routing Research Challenge, where the goal is to learn models that replicate the routing preferences of human drivers, using thousands of real-world routing examples. Our final IO-learned routing model achieves a score that ranks second compared with the 48 models that qualified for the final round of the challenge. Our examples and results showcase the flexibility and real-world potential of the proposed IO methodology to learn from decision-makers’ decisions in routing problems.History: This paper has been accepted for the Transportation Science Special Issue on TSL Conference 2023.Funding: This work was supported by the European Research Council [TRUST-949796].","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"93 1","pages":""},"PeriodicalIF":4.6,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141745351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Managing Concurrent Interactions in Online Time Slot Booking Systems for Attended Home Delivery 管理在线时间段预约系统中的并发互动，实现上门服务

IF 4.6 2区工程技术

Transportation Science Pub Date : 2024-07-17 DOI: 10.1287/trsc.2022.0445

Thomas R. Visser, Niels Agatz, Remy Spliet

{"title":"Managing Concurrent Interactions in Online Time Slot Booking Systems for Attended Home Delivery","authors":"Thomas R. Visser, Niels Agatz, Remy Spliet","doi":"10.1287/trsc.2022.0445","DOIUrl":"https://doi.org/10.1287/trsc.2022.0445","url":null,"abstract":"Many goods and services require the customer to be at home to receive the delivery. In the context of attended home delivery, customers can typically choose from a menu of delivery time slots. We consider the problem of dynamically managing the offered time slots and delivery bookings given the available fleet capacity. When multiple customers interact with the online booking system at the same time, this can lead to conflicts. Although managing such concurrent interactions is an important challenge in attended home delivery systems, it has not yet been addressed in the literature. We present a concurrency control strategy and several fast route planning approaches to manage time slots in real time. To combine fast response times with high quality slotting decisions, we introduce background procedures that use the time between successive order placements to improve the performance of the time slot offer and validation procedures. Our detailed computational experiments based on realistic instances provide insights into the effectiveness of our background procedures and the complex trade-offs between waiting times, valid orders, and invalid orders. We also discuss several relevant new areas of research in concurrency control for time slot management.Funding: This work was supported by the Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Grant 438-213-204]. It is co-funded by ORTEC B.V. and AH.nl.","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"47 1","pages":""},"PeriodicalIF":4.6,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141745352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0