Hongzhao Guan, Beste Basciftci, Pascal Van Hentenryck
{"title":"Path-Based Formulations for the Design of On-demand Multimodal Transit Systems with Adoption Awareness","authors":"Hongzhao Guan, Beste Basciftci, Pascal Van Hentenryck","doi":"10.1287/ijoc.2023.0014","DOIUrl":null,"url":null,"abstract":"<p>This paper reconsiders the On-Demand Multimodal Transit Systems (ODMTS) Design with Adoptions problem (ODMTS-DA) to capture the latent demand in on-demand multimodal transit systems. The ODMTS-DA is a bilevel optimization problem, for which Basciftci and Van Hentenryck proposed an exact combinatorial Benders decomposition. Unfortunately, their proposed algorithm only finds high-quality solutions for medium-sized cities and is not practical for large metropolitan areas. The main contribution of this paper is to propose a new path-based optimization model, called P-P<span>ath</span>, to address these computational difficulties. The key idea underlying P-P<span>ath</span> is to enumerate two specific sets of paths which capture the essence of the choice model associated with the adoption behavior of riders. With the help of these path sets, the ODMTS-DA can be formulated as a single-level mixed-integer programming model. In addition, the paper presents preprocessing techniques that can reduce the size of the model significantly. P-P<span>ath</span> is evaluated on two comprehensive case studies: the midsize transit system of the Ann Arbor – Ypsilanti region in Michigan (which was studied by Basciftci and Van Hentenryck) and the large-scale transit system for the city of Atlanta. The experimental results show that P-P<span>ath</span> solves the Michigan ODMTS-DA instances in a few minutes, bringing more than two orders of magnitude improvements compared with the existing approach. For Atlanta, the results show that P-P<span>ath</span> can solve large-scale ODMTS-DA instances (about 17 millions variables and 37 millions constraints) optimally in a few hours or in a few days. These results show the tremendous computational benefits of P-P<span>ath</span> which provides a scalable approach to the design of on-demand multimodal transit systems with latent demand.</p><p><b>History:</b> Accepted by Andrea Lodi, Design & Analysis of Algorithms—Discrete.</p><p><b>Funding:</b> This work was partially supported by National Science Foundation Leap-HI [Grant 1854684] and the Tier 1 University Transportation Center (UTC): Transit - Serving Communities Optimally, Responsively, and Efficiently (T-SCORE) from the U.S. Department of Transportation [69A3552047141].</p><p><b>Supplemental Material:</b> The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0014) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2023.0014). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/.</p>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"234 1","pages":""},"PeriodicalIF":2.3000,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informs Journal on Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1287/ijoc.2023.0014","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
This paper reconsiders the On-Demand Multimodal Transit Systems (ODMTS) Design with Adoptions problem (ODMTS-DA) to capture the latent demand in on-demand multimodal transit systems. The ODMTS-DA is a bilevel optimization problem, for which Basciftci and Van Hentenryck proposed an exact combinatorial Benders decomposition. Unfortunately, their proposed algorithm only finds high-quality solutions for medium-sized cities and is not practical for large metropolitan areas. The main contribution of this paper is to propose a new path-based optimization model, called P-Path, to address these computational difficulties. The key idea underlying P-Path is to enumerate two specific sets of paths which capture the essence of the choice model associated with the adoption behavior of riders. With the help of these path sets, the ODMTS-DA can be formulated as a single-level mixed-integer programming model. In addition, the paper presents preprocessing techniques that can reduce the size of the model significantly. P-Path is evaluated on two comprehensive case studies: the midsize transit system of the Ann Arbor – Ypsilanti region in Michigan (which was studied by Basciftci and Van Hentenryck) and the large-scale transit system for the city of Atlanta. The experimental results show that P-Path solves the Michigan ODMTS-DA instances in a few minutes, bringing more than two orders of magnitude improvements compared with the existing approach. For Atlanta, the results show that P-Path can solve large-scale ODMTS-DA instances (about 17 millions variables and 37 millions constraints) optimally in a few hours or in a few days. These results show the tremendous computational benefits of P-Path which provides a scalable approach to the design of on-demand multimodal transit systems with latent demand.
History: Accepted by Andrea Lodi, Design & Analysis of Algorithms—Discrete.
Funding: This work was partially supported by National Science Foundation Leap-HI [Grant 1854684] and the Tier 1 University Transportation Center (UTC): Transit - Serving Communities Optimally, Responsively, and Efficiently (T-SCORE) from the U.S. Department of Transportation [69A3552047141].
Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0014) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2023.0014). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/.
期刊介绍:
The INFORMS Journal on Computing (JOC) is a quarterly that publishes papers in the intersection of operations research (OR) and computer science (CS). Most papers contain original research, but we also welcome special papers in a variety of forms, including Feature Articles on timely topics, Expository Reviews making a comprehensive survey and evaluation of a subject area, and State-of-the-Art Reviews that collect and integrate recent streams of research.