异质乘客走廊问题的队列替换原则

IF 5.8 1区 工程技术 Q1 ECONOMICS
Takara Sakai , Takashi Akamatsu , Koki Satsukawa
{"title":"异质乘客走廊问题的队列替换原则","authors":"Takara Sakai ,&nbsp;Takashi Akamatsu ,&nbsp;Koki Satsukawa","doi":"10.1016/j.trb.2024.103024","DOIUrl":null,"url":null,"abstract":"<div><p>This study investigates the theoretical properties of a departure time choice problem considering commuters’ heterogeneity with respect to the value of schedule delay in corridor networks. Specifically, we develop an analytical method to solve the dynamic system optimal (DSO) and dynamic user equilibrium (DUE) problems. To derive the DSO solution, we first demonstrate the bottleneck-based decomposition property, i.e., the DSO problem can be decomposed into multiple single bottleneck problems. Subsequently, we obtain the analytical solution by applying the theory of optimal transport to each decomposed problem and derive optimal congestion prices to achieve the DSO state. To derive the DUE solution, we prove the queue replacement principle (QRP) that the time-varying optimal congestion prices are equal to the queueing delay in the DUE state at every bottleneck. This principle enables us to derive a closed-form DUE solution based on the DSO solution. Moreover, as an application of the QRP, we prove that the equilibrium solution under various policies (e.g., on-ramp metering, on-ramp pricing, and its partial implementation) can be obtained analytically. Finally, we compare these equilibria with the DSO state.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"187 ","pages":"Article 103024"},"PeriodicalIF":5.8000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0191261524001486/pdfft?md5=514aa11562e2ef88b53e31071afb3505&pid=1-s2.0-S0191261524001486-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Queue replacement principle for corridor problems with heterogeneous commuters\",\"authors\":\"Takara Sakai ,&nbsp;Takashi Akamatsu ,&nbsp;Koki Satsukawa\",\"doi\":\"10.1016/j.trb.2024.103024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This study investigates the theoretical properties of a departure time choice problem considering commuters’ heterogeneity with respect to the value of schedule delay in corridor networks. Specifically, we develop an analytical method to solve the dynamic system optimal (DSO) and dynamic user equilibrium (DUE) problems. To derive the DSO solution, we first demonstrate the bottleneck-based decomposition property, i.e., the DSO problem can be decomposed into multiple single bottleneck problems. Subsequently, we obtain the analytical solution by applying the theory of optimal transport to each decomposed problem and derive optimal congestion prices to achieve the DSO state. To derive the DUE solution, we prove the queue replacement principle (QRP) that the time-varying optimal congestion prices are equal to the queueing delay in the DUE state at every bottleneck. This principle enables us to derive a closed-form DUE solution based on the DSO solution. Moreover, as an application of the QRP, we prove that the equilibrium solution under various policies (e.g., on-ramp metering, on-ramp pricing, and its partial implementation) can be obtained analytically. Finally, we compare these equilibria with the DSO state.</p></div>\",\"PeriodicalId\":54418,\"journal\":{\"name\":\"Transportation Research Part B-Methodological\",\"volume\":\"187 \",\"pages\":\"Article 103024\"},\"PeriodicalIF\":5.8000,\"publicationDate\":\"2024-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0191261524001486/pdfft?md5=514aa11562e2ef88b53e31071afb3505&pid=1-s2.0-S0191261524001486-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part B-Methodological\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0191261524001486\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part B-Methodological","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0191261524001486","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

本研究探讨了出发时间选择问题的理论特性,该问题考虑到了通勤者对走廊网络中班次延误价值的异质性。具体来说,我们开发了一种分析方法来解决动态系统最优(DSO)和动态用户均衡(DUE)问题。为了得出 DSO 解决方案,我们首先证明了基于瓶颈的分解特性,即 DSO 问题可以分解为多个单瓶颈问题。随后,我们将最优运输理论应用于每个分解问题,得到解析解,并推导出最优拥塞价格,以实现 DSO 状态。为了得出 DUE 解决方案,我们证明了队列置换原理(QRP),即随时间变化的最优拥堵价格等于每个瓶颈处 DUE 状态下的队列延迟。这一原理使我们能够在 DSO 解决方案的基础上推导出闭式 DUE 解决方案。此外,作为 QRP 的一个应用,我们证明了各种政策(如匝道计量、匝道定价及其部分实施)下的均衡解都可以通过分析得到。最后,我们将这些均衡方案与 DSO 状态进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Queue replacement principle for corridor problems with heterogeneous commuters

This study investigates the theoretical properties of a departure time choice problem considering commuters’ heterogeneity with respect to the value of schedule delay in corridor networks. Specifically, we develop an analytical method to solve the dynamic system optimal (DSO) and dynamic user equilibrium (DUE) problems. To derive the DSO solution, we first demonstrate the bottleneck-based decomposition property, i.e., the DSO problem can be decomposed into multiple single bottleneck problems. Subsequently, we obtain the analytical solution by applying the theory of optimal transport to each decomposed problem and derive optimal congestion prices to achieve the DSO state. To derive the DUE solution, we prove the queue replacement principle (QRP) that the time-varying optimal congestion prices are equal to the queueing delay in the DUE state at every bottleneck. This principle enables us to derive a closed-form DUE solution based on the DSO solution. Moreover, as an application of the QRP, we prove that the equilibrium solution under various policies (e.g., on-ramp metering, on-ramp pricing, and its partial implementation) can be obtained analytically. Finally, we compare these equilibria with the DSO state.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Transportation Research Part B-Methodological
Transportation Research Part B-Methodological 工程技术-工程:土木
CiteScore
12.40
自引率
8.80%
发文量
143
审稿时长
14.1 weeks
期刊介绍: Transportation Research: Part B publishes papers on all methodological aspects of the subject, particularly those that require mathematical analysis. The general theme of the journal is the development and solution of problems that are adequately motivated to deal with important aspects of the design and/or analysis of transportation systems. Areas covered include: traffic flow; design and analysis of transportation networks; control and scheduling; optimization; queuing theory; logistics; supply chains; development and application of statistical, econometric and mathematical models to address transportation problems; cost models; pricing and/or investment; traveler or shipper behavior; cost-benefit methodologies.
×
引用
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学术官方微信