Path-Based Formulations for the Design of On-demand Multimodal Transit Systems with Adoption Awareness

IF 2.3 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
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 &amp; 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/.

设计具有采纳意识的按需多式联运系统的路径公式
本文重新考虑了按需多式联运系统(ODMTS)设计与采用问题(ODMTS-DA),以捕捉按需多式联运系统中的潜在需求。ODMTS-DA 是一个双层优化问题,Basciftci 和 Van Hentenryck 提出了一种精确的组合本德斯分解法。遗憾的是,他们提出的算法只能为中等城市找到高质量的解决方案,对于大都市地区并不实用。本文的主要贡献在于提出了一种新的基于路径的优化模型,称为 P-Path,以解决这些计算难题。P-Path 模型的主要思想是列举两组特定的路径,这两组路径抓住了与乘客采用行为相关的选择模型的本质。在这些路径集的帮助下,ODMTS-DA 可以表述为一个单级混合整数编程模型。此外,本文还介绍了可显著缩小模型规模的预处理技术。P-Path 在两个综合案例研究中进行了评估:密歇根州安阿伯-伊普西兰蒂地区的中型公交系统(Basciftci 和 Van Hentenryck 对其进行了研究)和亚特兰大市的大型公交系统。实验结果表明,P-Path 可在几分钟内解决密歇根州的 ODMTS-DA 实例,与现有方法相比提高了两个数量级以上。对于亚特兰大市,实验结果表明,P-Path 可以在几小时或几天内优化求解大规模 ODMTS-DA 实例(约 1,700 万个变量和 3,700 万个约束条件)。这些结果表明,P-Path 具有巨大的计算优势,为设计具有潜在需求的按需多式联运系统提供了一种可扩展的方法:由 Andrea Lodi 接受,Design & Analysis of Algorithms-Discrete.Funding:本研究得到了美国国家科学基金会 Leap-HI [Grant 1854684] 和一级大学交通中心 (UTC) 的部分支持:补充材料:支持本研究结果的软件可从论文及其补充信息 (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0014) 以及 IJOC GitHub 软件库 (https://github.com/INFORMSJoC/2023.0014) 中获取。完整的 IJOC 软件和数据资源库可从 https://informsjoc.github.io/ 获取。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Informs Journal on Computing
Informs Journal on Computing 工程技术-计算机:跨学科应用
CiteScore
4.20
自引率
14.30%
发文量
162
审稿时长
7.5 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信