双区域城市网络的时间约束需求管理

S. Kumarage, Mehmet Yildirimoglu, Mohsen Ramezani Ghalenoei, Zuduo Zheng
{"title":"双区域城市网络的时间约束需求管理","authors":"S. Kumarage, Mehmet Yildirimoglu, Mohsen Ramezani Ghalenoei, Zuduo Zheng","doi":"10.1287/trsc.2021.1052","DOIUrl":null,"url":null,"abstract":"Demand management aiming to optimize system cost while ensuring user compliance in an urban traffic network is a challenging task. This paper introduces a cooperative demand redistribution strategy to optimize network performance through the retiming of departure times within a limited time window. The proposed model minimizes the total time spent in a two-region urban network by incurring minimal disruption to travelers’ departure schedules. Two traffic models based on the macroscopic fundamental diagram (MFD) are jointly implemented to redistribute demand and analyze travelers’ reaction. First, we establish equilibrium conditions via a day-to-day assignment process, which allows travelers to find their preferred departure times. The trip-based MFD model that incorporates individual traveler attributes is implemented in the day-to-day assignment, and it is conjugated with a network-level detour ratio model to incorporate the effect of congestion in individual traveler route choice. This allows us to consider travelers with individual preferences on departure times influenced by desired arrival times, trip lengths, and earliness and lateness costs. Second, we develop a nonlinear optimization problem to minimize the total time spent considering both observed and unobserved demand—that is, travelers opting in and out of the demand management platform. The accumulation-based MFD model that builds on aggregated system representation is implemented as part of the constraints in the nonlinear optimization problem. The results confirm the resourcefulness of the model to address complex two-region traffic dynamics and to increase overall performance by reaching a constrained system optimum scenario while ensuring the applicability at both full and partial user compliance conditions.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"47 1","pages":"857-882"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Schedule-Constrained Demand Management in Two-Region Urban Networks\",\"authors\":\"S. Kumarage, Mehmet Yildirimoglu, Mohsen Ramezani Ghalenoei, Zuduo Zheng\",\"doi\":\"10.1287/trsc.2021.1052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Demand management aiming to optimize system cost while ensuring user compliance in an urban traffic network is a challenging task. This paper introduces a cooperative demand redistribution strategy to optimize network performance through the retiming of departure times within a limited time window. The proposed model minimizes the total time spent in a two-region urban network by incurring minimal disruption to travelers’ departure schedules. Two traffic models based on the macroscopic fundamental diagram (MFD) are jointly implemented to redistribute demand and analyze travelers’ reaction. First, we establish equilibrium conditions via a day-to-day assignment process, which allows travelers to find their preferred departure times. The trip-based MFD model that incorporates individual traveler attributes is implemented in the day-to-day assignment, and it is conjugated with a network-level detour ratio model to incorporate the effect of congestion in individual traveler route choice. This allows us to consider travelers with individual preferences on departure times influenced by desired arrival times, trip lengths, and earliness and lateness costs. Second, we develop a nonlinear optimization problem to minimize the total time spent considering both observed and unobserved demand—that is, travelers opting in and out of the demand management platform. The accumulation-based MFD model that builds on aggregated system representation is implemented as part of the constraints in the nonlinear optimization problem. The results confirm the resourcefulness of the model to address complex two-region traffic dynamics and to increase overall performance by reaching a constrained system optimum scenario while ensuring the applicability at both full and partial user compliance conditions.\",\"PeriodicalId\":23247,\"journal\":{\"name\":\"Transp. Sci.\",\"volume\":\"47 1\",\"pages\":\"857-882\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transp. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/trsc.2021.1052\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transp. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/trsc.2021.1052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在城市交通网络中,以优化系统成本同时保证用户合规性为目标的需求管理是一项具有挑战性的任务。本文提出了一种合作需求再分配策略,通过在有限的时间窗口内重新安排发车时间来优化网络性能。提出的模型通过对旅客出发计划的最小干扰,最大限度地减少在两个区域的城市网络中花费的总时间。结合基于宏观基本图(MFD)的两种交通模型进行需求再分配,并分析出行者的反应。首先,我们通过日常分配流程建立平衡条件,让旅行者找到他们喜欢的出发时间。在日常分配中实现了包含出行者个体属性的基于行程的MFD模型,并将其与网络级绕行比模型相结合,以考虑拥堵对出行者个体路径选择的影响。这使我们能够考虑受期望到达时间、行程长度以及早到和晚到成本影响的个人偏好的旅行者。其次,我们开发了一个非线性优化问题,以最小化所花费的总时间,同时考虑到观察到的和未观察到的需求-即旅行者选择进入和退出需求管理平台。建立在聚合系统表示基础上的基于累加的MFD模型作为非线性优化问题约束的一部分实现。结果证实了该模型的智能性,可以解决复杂的两区域交通动态问题,并通过达到约束系统的最佳方案来提高整体性能,同时确保在完全和部分用户遵从条件下的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Schedule-Constrained Demand Management in Two-Region Urban Networks
Demand management aiming to optimize system cost while ensuring user compliance in an urban traffic network is a challenging task. This paper introduces a cooperative demand redistribution strategy to optimize network performance through the retiming of departure times within a limited time window. The proposed model minimizes the total time spent in a two-region urban network by incurring minimal disruption to travelers’ departure schedules. Two traffic models based on the macroscopic fundamental diagram (MFD) are jointly implemented to redistribute demand and analyze travelers’ reaction. First, we establish equilibrium conditions via a day-to-day assignment process, which allows travelers to find their preferred departure times. The trip-based MFD model that incorporates individual traveler attributes is implemented in the day-to-day assignment, and it is conjugated with a network-level detour ratio model to incorporate the effect of congestion in individual traveler route choice. This allows us to consider travelers with individual preferences on departure times influenced by desired arrival times, trip lengths, and earliness and lateness costs. Second, we develop a nonlinear optimization problem to minimize the total time spent considering both observed and unobserved demand—that is, travelers opting in and out of the demand management platform. The accumulation-based MFD model that builds on aggregated system representation is implemented as part of the constraints in the nonlinear optimization problem. The results confirm the resourcefulness of the model to address complex two-region traffic dynamics and to increase overall performance by reaching a constrained system optimum scenario while ensuring the applicability at both full and partial user compliance conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信