首页> 美国卫生研究院文献>other >Network capacity with probit-based stochastic user equilibrium problem
【2h】

Network capacity with probit-based stochastic user equilibrium problem

机译:具有基于概率的随机用户均衡问题的网络容量

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Among different stochastic user equilibrium (SUE) traffic assignment models, the Logit-based stochastic user equilibrium (SUE) is extensively investigated by researchers. It is constantly formulated as the low-level problem to describe the drivers’ route choice behavior in bi-level problems such as network design, toll optimization et al. The Probit-based SUE model receives far less attention compared with Logit-based model albeit the assignment result is more consistent with drivers’ behavior. It is well-known that due to the identical and irrelevant alternative (IIA) assumption, the Logit-based SUE model is incapable to deal with route overlapping problem and cannot account for perception variance with respect to trips. This paper aims to explore the network capacity with Probit-based traffic assignment model and investigate the differences of it is with Logit-based SUE traffic assignment models. The network capacity is formulated as a bi-level programming where the up-level program is to maximize the network capacity through optimizing input parameters (O-D multiplies and signal splits) while the low-level program is the Logit-based or Probit-based SUE problem formulated to model the drivers’ route choice. A heuristic algorithm based on sensitivity analysis of SUE problem is detailed presented to solve the proposed bi-level program. Three numerical example networks are used to discuss the differences of network capacity between Logit-based SUE constraint and Probit-based SUE constraint. This study finds that while the network capacity show different results between Probit-based SUE and Logit-based SUE constraints, the variation pattern of network capacity with respect to increased level of travelers’ information for general network under the two type of SUE problems is the same, and with certain level of travelers’ information, both of them can achieve the same maximum network capacity.
机译:在不同的随机用户均衡(SUE)流量分配模型中,研究人员广泛研究了基于Logit的随机用户均衡(SUE)。它经常被表述为低级问题,用于在网络设计,通行费优化等双层问题中描述驾驶员的路线选择行为。与基于Logit的模型相比,基于Probit的SUE模型受到的关注要少得多,尽管分配结果与驾驶员的行为更加一致。众所周知,由于相同且不相关的替代(IIA)假设,基于Logit的SUE模型无法处理路线重叠问题,并且无法考虑行程的感知差异。本文旨在探索基于Probit的流量分配模型的网络容量,并研究基于Logit的SUE流量分配模型与网络容量的区别。网络容量被表述为双层程序,其中上层程序通过优化输入参数(OD倍增和信号分割)来最大化网络容量,而下层程序则是基于Logit或Probit的SUE。为驾驶员的路线选择建模的问题。提出了一种基于SUE问题敏感性分析的启发式算法来解决所提出的双层程序。使用三个数值示例网络来讨论基于Logit的SUE约束和基于Probit的SUE约束之间的网络容量差异。这项研究发现,虽然网络容量在基于Probit的SUE和基于Logit的SUE约束之间显示出不同的结果,但是在两种类型的SUE问题下,相对于一般网络的旅行者信息水平而言,网络容量的变化模式是相同,并且具有一定程度的旅行者信息,他们两者都可以实现相同的最大网络容量。

著录项

  • 期刊名称 other
  • 作者单位
  • 年(卷),期 -1(12),2
  • 年度 -1
  • 页码 e0171158
  • 总页数 19
  • 原文格式 PDF
  • 正文语种
  • 中图分类
  • 关键词

  • 入库时间 2022-08-21 11:10:30

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号